Items where Subject is "90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items at this level: 20.

Naddef, Denis and Thienel, Stefan (2002) Efficient Separation Routines for the Symmetric Traveling Salesman -- Problem I: General Tools and Comb Separation.
Published in: Mathematical programming : Series A Vol. 92 (2). pp. 237-255.

Naddef, Denis and Thienel, Stefan (2002) Efficient Separation Routines for the Symmetric Traveling Salesman -- Problem II: Separating multi Handle Inequalities.
Published in: Mathematical programming : Series A Vol. 92 (2). pp. 257-283.

Genc, Zuelfuekar and Speckenmeyer, Ewald (2001) Fahrplanoptimierung im ÖPNV.
Technical Report , 7 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.

Elf, Matthias and Gutwenger, Carsten and Jünger, Michael and Rinaldi, Giovanni (2001) Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS.
Published in: Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions., Lecture Notes in Computer Science. 2241 Springer 2001, pp. 157-222.

Buchheim, Christoph and Ebner, Dietmar and Jünger, Michael and Klau, Gunnar W. and Mutzel, Petra and Weiskircher, René (2006) Exact Crossing Minimization.
Published In: Graph drawing : 13th international symposium, GD 2005, Limerick, Ireland, September 12 - 14, 2005 ; revised papers, Lecture Notes in Computer Science. 3843 Springer 2006, pp. 37-48.

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 Chimani, Markus and Ebner, Dietmar and Gutwenger, Carsten and Jünger, Michael and Klau, Gunnar W. and Mutzel, Petra and Weiskircher, René (2008) A branch-and-cut approach to the crossing number problem.
Published in: Discrete optimization Vol. 5 (2). pp. 373-388.

Buchheim, Christoph and Liers, Frauke and Oswald, Marcus (2008) Local Cuts Revisited.
Published in: Operations Research Letters Vol. 36 (4). pp. 430-433.

Ghaddar, Bissan and Anjos, Miguel and Liers, Frauke (2007) A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem.
Published in: Annals of Operations Research Vol. 188 (1). pp. 155-174.

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.

Buchheim, Christoph and Liers, Frauke and Oswald, Marcus (2008) A Basic Toolbox for Constrained Quadratic 0/1 Optimization.
Published In: Experimental algorithms 7th international workshop, WEA 2008, Provincetown, MA, USA, May 30 - June 1, 2008 ; proceedings, Lecture Notes in Computer Science. 5038 Springer 2008, pp. 249-262.

Buchheim, Christoph and Liers, Frauke and Oswald, Marcus (2010) Speeding up IP-based Algorithms for Constrained Quadratic 0-1 Optimization.
Published in: Mathematical Programming B Vol. 124 (1-2). pp. 513-535.

Baumann, Frank and Buchheim, Christoph (2009) Compact and Extended Formulations for Range Assignment Problems.
Technical Report , 14 p.

Bomze, Immanuel and Chimani, Markus and Jünger, Michael and Ljubic, Ivana and Mutzel, Petra and Zey, Bernd (2011) Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut.
Published In: ISAAC 2010, Part I, LNCS. 6506 Springer-Verlag 2011, pp. 427-439.

Buchheim, Christoph and Liers, Frauke and Sanita, Laura (2011) An Exact Algorithm for Robust Network Design.
Published In: Network Optimization : 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, Lecture notes in computer science. 6701 Springer Verlag 2011, pp. 7-14.

Á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.

Bonato, Thorsten and Jünger, Michael and Reinelt, Gerhard and Rinaldi, Giovanni (2013) Lifting and Separation Procedures for the Cut Polytope.
Published in: Mathematical Programming A. ISSN 0025-5610

Cacchiani, Valentina and Jünger, Michael and Liers, Frauke and Lodi, Andrea and Schmidt, Daniel R. (2014) Single-Commodity Robust Network Design with Finite and Hose Demand Sets.
Technical Report , 32 p.
Submitted

Cacchiani, Valentina and Jünger, Michael and Liers, Frauke and Lodi, Andrea and Schmidt, Daniel R. (2016) Single-commodity robust network design with finite and Hose demand sets.
Published in: Mathematical Programming Vol. 157 (1). pp. 297-342. ISSN 0025-5610

This list was generated on Sat Aug 19 04:02:36 2017 CEST.