Items where Subject is "65-XX Numerical analysis > 65Kxx Mathematical programming, optimization and variational techniques > 65K05 Mathematical programming"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Authors | Item Type
Jump to: B | C | D | F | G | J | K | L | P
Number of items at this level: 12.


Barahona, Francisco and Jünger, Michael and Reinelt, Gerhard (1989) Experiments in Quadratic 0–1 Programming.
Published in: Mathematical Programming Vol. 44 (1-3). pp. 127-137. ISSN 0025-5610

Buchheim, Christoph and Rinaldi, Giovanni (2007) Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case.
Published in: SIAM Journal on Optimization Vol. 18 (4). pp. 1398-1413.

Buchheim, Christoph and Rinaldi, Giovanni (2009) Terse Integer Linear Programs for Boolean Optimization.
Published in: Journal on Satisfiability, Boolean Modeling and Computation Vol. 6. pp. 121-139.


Chimani, Markus and Hungerländer, Philipp and Jünger, Michael and Mutzel, Petra (2011) An SDP approach to multi-level crossing minimization.
Published In: Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX 2011) SIAM March 2011, pp. 116-126.


Derigs, Ulrich and Goecke, Oskar and Schrader, Rainer (1986) Monge sequences and a simple assignment algorithm.
Published in: Discrete Applied Mathematics Vol. 15 (2-3). pp. 241-248.


Faigle, Ulrich and Schrader, Rainer (1985) A setup heuristic for interval orders.
Published in: Operations Research Letters Vol. 4 (4). pp. 185-188.


Grötschel, Martin and Jünger, Michael and Reinelt, Gerhard (1984) A Cutting Plane Algorithm for the Linear Ordering Problem.
Published in: Operations Research Vol. 32 (6). pp. 1195-1220.


Jünger, Michael and Reinelt, Gerhard and Thienel, Stefan (1995) Practical Problem Solving with cutting Plane Algorithms in Combinatorial Optimization.
Published in: Practical Problem Solving with cutting Plane Algorithms in Combinatorial Optimization., DIMACS Series in Discrete Mathematics and Theoretical Computer Sciences. American Mathematical Society 1995, pp. 111-152.


Kern, Walter (1986) An Efficient Algorithm for Solving a Special Class of LP's.
Published in: Computing : archives for scientific computing Vol. 37 (3). pp. 219-226.

Korte, Bernhard and Schrader, Rainer (1984) Can the ellipsoid method be efficient?
Published in: Operations Research and Economic Theory : Essays in Honor of Martin J. Beckmann. Springer 1984.


Leclerc, Matthias and Rendl, Franz (1989) Constrained Spanning Trees and the Travelling Salesman Problem.
Published in: European journal of operational research Vol. 39 (1). pp. 96-102.


Pickl, Stefan and Weber, Gerhard-Wilhelm (2000) An Algorithmic Approach by Linear Programming Problems In Generalized Semi-Infinite Optimization.
Published in: Vycislitel'nye technologii : zurnal = Computational technologies Vol. 5 (3). pp. 62-82.

This list was generated on Sun Oct 22 08:35:19 2017 CEST.