Items where Subject is "90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C10 Integer programming"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Authors | Item Type
Jump to: A | B | G | H | J | K | L | M | N | S | T | Z | Á
Number of items at this level: 42.

A

Arnim, Annelie von and Faigle, Ulrich and Schrader, Rainer (1990) The permutahedron of series-parallel posets.
Published in: Discrete Applied Mathematics Vol. 28 (1). pp. 3-9.

Arnim, Annelie von and Schrader, Rainer and Wang, Yaoguang (1996) The Permutahedron of N-sparse Posets.
Published in: Mathematical programming : Series A Vol. 75 (1). pp. 1-18.

B

Bachem, Achim and Euler, Reinhardt (1984) Recent Trends in Combinatorial Optimization.
Published in: OR-Spektrum : quantitative approaches in management Vol. 6 (1). pp. 1-21.

Bachem, Achim and Johnson, Ellis L. and Schrader, Rainer (1982) A characterization of minimal inequalities for mixed integer programs.
Published in: Operations Research Letters Vol. 1 (2). pp. 63-66.

Bauer, Petra (1997) The Circuit Polytope: Facets.
Published in: Mathematics of operations research Vol. 22 (1). pp. 110-145.

Buchheim, Christoph and Caprara, Alberto and Lodi, Andrea (2010) An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming.
Published In: Integer programming and combinatorial optimization : 14th international conference, IPCO 2010, Lausanne, Switzerland, June 9 - 11, 2010 ; proceedings, Lecture notes in computer science. 6080 Springer 2010, pp. 285-298.

Buchheim, Christoph and Jünger, Michael (2003) Detecting Symmetries by Branch & Cut (Journal Version).
Published in: Mathematical Programming B Vol. 98 (1-3). pp. 369-384.

Buchheim, Christoph and Jünger, Michael (2005) Linear Optimization over Permutation Groups.
Published in: Discrete Optimization Vol. 2 (4). pp. 308-319.

Buchheim, Christoph and Michaels, Dennis and Weismantel, Robert (2010) Integer Programming Subject to Monomial Constraints.
Published in: SIAM journal on optimization : a publication of the Society for Industrial and Applied Mathematics Vol. 20 (6). pp. 3297-3311.

G

Grötschel, Martin and Jünger, Michael and Reinelt, Gerhard (1985) Acyclic Subdigraphs and Linear Orderings: Polytopes, Facets, and a cutting Plane Algorithm.
Published in: Graphs and Order : the Role of graphs in the Theory of Ordered Sets and its Aplications., NATO ASI series : Series C, Mathematical and physical sciences ; 147. D. Reidel Publishing Company 1985, pp. 218-264.

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.

Grötschel, Martin and Jünger, Michael and Reinelt, Gerhard (1985) Facets of the Linear Ordering Polytope.
Published in: Mathematical Programming Vol. 33 (1). pp. 43-60. ISSN 0025-5610

Grötschel, Martin and Jünger, Michael and Reinelt, Gerhard (1985) On the acyclic Subgraph Polytope.
Published in: Mathematical Programming Vol. 33 (1). pp. 28-42. ISSN 0025-5610

H

Hochstättler, Winfried (1996) Semidefinite Programmierung.
Technical Report , 95 p.

J

Jünger, Michael and Kaibel, Volker (1996) A Basic Study of the QAP-Polytope.
Technical Report , 20 p.

Jünger, Michael and Kaibel, Volker (2000) On the SQAP-Polytope.
Published in: SIAM Journal on Optimization Vol. 11 (2). pp. 444-463.

Jünger, Michael and Kaibel, Volker (2001) The QAP-Polytope and the Star-Transformation.
Published in: Discrete Applied Mathematics Vol. 111 (3). pp. 283-306.

Jünger, Michael and Mallach, Sven (2015) An Integer Programming Approach to Optimal Basic Block Instruction Scheduling for Single-Issue Processors.
Published in: Discrete Optimization (Special Issue on Combinatorial Optimization). ISSN 1572-5286

Jünger, Michael and Mallach, Sven (2013) Solving the Simple Offset Assignment Problem as a Traveling Salesman.
Published In: M-SCOPES '13: Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems ACM 2013, pp. 31-39.

Jünger, Michael and Mutzel, Petra (1993) Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut.
Published In: Proc. third conference of integer programming and combinatorial optimization (IPCO) IPCO Conference 1993, pp. 479-492.

K

Kaibel, Volker (1997) Polyhedral Combinatorics of QAPs with Less Objects than Locations (Extended Abstract).
Technical Report , 10 p.

Korte, Bernhard and Schrader, Rainer (1981) On the existence of fast approximation schemes.
Published In: Nonlinear Programming 4 Academic Press 1981, pp. 415-437.

Korte, Bernhard and Schrader, Rainer (1981) A survey on oracle techniques.
Published In: Mathematical Foundations of Computer Science ; Proceedings, 10th Symposium Štrbské Pleso, Czechoslovakia August 31 – September 4, 1981, Lecture Notes in Computer Science. 118 Springer 1981, pp. 61-77.

L

Lückerath, Daniel and Ullrich, Oliver and Kupicha, Aleksander and Speckenmeyer, Ewald (2014) Multi-depot multi-vehicle-type vehicle scheduling for Cologne’s tram network.
Published In: Proceedings of ASIM-Workshop STS/GMMS 2014, ASIM Mitteilungen. AM 149 ARGESIM/ASIM Pub., TU Vienna/Austria, Scheible, J.; Bausch-Gall, I.; Deatcu, C. (Ed.) February 2014, pp. 191-197.

M

Mallach, Sven (2016) Compact Linearization for Binary Quadratic Problems subject to Assignment Constraints.
Technical Report , 9 p.

Mallach, Sven (2015) Exact Integer Programming Approaches to Sequential Instruction Scheduling and Offset Assignment. ["eprint_fieldopt_thesis_type_phd" not defined] thesis.

Mallach, Sven (2015) More General Optimal Offset Assignment.
Published in: Leibniz Transactions on Embedded Systems Vol. 2 (1). 02--1-02--18. ISSN 2199-2002

Mallach, Sven and Lozano, Roberto Castañeda (2014) Optimal general offset assignment.
Published In: Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems - SCOPES '14 ACM 2014, pp. 50-59.

Mutzel, Petra (1994) s-Chorded Cycle Graphs and their Relation to the Planar Subgraph Polytope.
Technical Report , 13 p.

Mutzel, Petra and Jünger, Michael (2004) Graph Drawing: Exact Optimization helps!
Published in: The sharpest cut: the impact of Manfred Padberg and his work ; [invited lectures given at a workshop held in October 2001 to celebrate Padberg's 60th birthday ; Workshop in Honor of Manfred Padberg]., MPS-SIAM series on optimization. 4 SIAM 2004.

N

Neuhaus, Stefan (2009) Eigenschaften kleinster dominierender Mengen und Dominanzzahlen von Damengraphen. ["eprint_fieldopt_thesis_type_phd" not defined] thesis.

S

Schrader, Rainer (1982) Ellipsoid methods.
Published In: Modern applied mathematics : optimization and operations research ; collection of state-of-the-art surveys based on lectures presented at the Summer School "Optimization and Operations Research", held at the Univ. of Bonn, September 14 - 22, 1979 North Holland 1982, pp. 265-311.

Schrader, Rainer and Wambach, Georg (1994) Integer polyhedra from supermodular functions on series-parallel posets.
Technical Report , 13 p.

Schrader, Rainer and Wambach, Georg (1997) The Setup Polyhedron of Series-Parallel Posets.
Published in: Discrete Applied Mathematics Vol. 79 (1-3). pp. 213-221.

Schrader, Rainer and Wambach, Georg (1999) The setup polytope of N-sparse posets.
Published in: Annals of Operations Research Vol. 92. pp. 125-142.

Srivastav, Anand and Stangier, Peter (1996) Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming.
Published In: Algorithms and Computation : 5th International Symposium, ISAAC '94 Beijing, P. R. China, August 2527, 1994 Proceedings, Lecture notes in computer science. 834 Springer 1996, pp. 226-233.

Srivastav, Anand and Stangier, Peter (1996) Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming.
Published in: Random structures & algorithms Vol. 8 (1). pp. 27-58.

Srivastav, Anand and Stangier, Peter (1997) Tight Approximation for Resource Constrained Scheduling and Bin Packing.
Published in: Discrete Applied Mathematics Vol. 79 (1-3). pp. 223-245.

Srivastav, Anand and Stangier, Peter (1994) Tight Approximation for Resource Constrained Scheduling and Bin Packing.
Published In: Algorithms ESA '94 : Second Annual European Symposium Utrecht, The Netherlands, September 26 - 28, 1994 Proceedings, Lecture notes in computer science. 855 Springer 1994, pp. 307-318.

T

Thienel, Stefan and Jünger, Michael (1997) The Design of the Branch-and-Cut System ABACUS.
Technical Report , 30 p.

Z

Zimmermann, Uwe (1984) Submodulare Flüsse: Verfahren zur Minimierung linearer Zielfunktionen.
Technical Report , 40 p.

Á

Álvarez-Miranda, Eduardo and Cacchiani, Valentina and Dorneth, Tim and Jünger, Michael and Liers, Frauke and Lodi, Andrea and Parriani, Tiziano and Schmidt, Daniel R. (2012) Models and Algorithms for Robust Network Design with Several Traffic Scenarios.
Published In: Combinatorial Optimization : Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers, Lecture notes in computer science. 7422 Springer-Verlag 2012, pp. 261-272.

This list was generated on Tue Oct 24 13:13:08 2017 CEST.