A basic toolbox for constrained quadratic 0/1 optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5038 LNCS, Issue , 2008, Pages 249-262

  Buchheim, Christoph ^a   Liers, Frauke ^a   Oswald, Marcus ^b  

^a UNIVERSITY OF COLOGNE   (Germany)

^b UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

Crossing minimization; Local cuts; Maximum cut problem; Quadratic programming; Similar subgraphs

Indexed keywords

AEROSPACE APPLICATIONS; ALGORITHMS; ARCHITECTURAL DESIGN; DRAWING (GRAPHICS); EVOLUTIONARY ALGORITHMS; FUNCTION EVALUATION; INTEGER PROGRAMMING; ISOMERS; LINEARIZATION; OPTIMIZATION; PLANNING; PRODUCTION CONTROL; PROJECT MANAGEMENT; QUADRATIC PROGRAMMING; SEPARATION; STANDARDS; TOPOLOGY; WELL STIMULATION;

BLACK BOXES; BRANCH-AND-CUT; EXACT SOLUTIONS; EXPERIMENTAL ALGORITHMS; GENERAL (CO); GRAPH DRAWING; HEIDELBERG (CO); IN ORDER; INTERNATIONAL (CO); KNAPSACK PROBLEMS; NON LINEAR FUNCTIONS; POLYHEDRAL STUDIES; POLYTOPE; POLYTOPES; PRACTICAL APPLICATIONS; PRODUCTION PLANNING; QUADRATIC ASSIGNMENT; QUADRATIC OBJECTIVE FUNCTIONS; QUADRATIC OPTIMIZATION; SPRINGER (CO); TRAVELING SALESMAN; TRAVELLING SALESMAN;

CONSTRAINED OPTIMIZATION;

EID: 45449092546     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68552-4_19     Document Type: Conference Paper

References (7)

1. Applegate, A., Bixby, R., Chvátal, V., Cook, W.: TSP cuts which do not conform to the template paradigm. In: Jünger, M., Naddef, D. (eds.) Computational Combinatorial Optimization. LNCS, vol. 2241, pp. 261-304. Springer, Heidelberg (2001)
2. Barahona, F., Mahjoub, A.R.: On the cut polytope. Mathematical Programming 36, 157-173 (1986)
3. Buchheim, C., Liers, F., Oswald, M.: Local cuts revisited. Operations Research Letters (2008), doi:10.1016/j.orl.2008.01.004
4. De Simone, C.: The cut polytope and the Boolean quadric polytope. Discrete Mathematics 79, 71-75 (1990)
5. Deza, M., Laurent, M.: Geometry of Cuts and Metrics. Algorithms and Combinatorics, vol. 15. Springer, Heidelberg (1997)
6. Liers, F., Jünger, M., Reinelt, G., Rinaldi, G.: Computing Exact Ground States of Hard Ising Spin Glass Problems by Branch-and-Cut. New Optimization Algorithms in Physics, pp. 47-68. Wiley-VCH, Chichester (2004)
7. Rendl, F., Rinaldi, G., Wiegele, A.: A branch and bound algorithm for Max-Cut based on combining semidefinite and polyhedral relaxations. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 295-309. Springer, Heidelberg (2007)