Result 1 to 20 of 106 total
On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square. (English)
Discrete Appl. Math. 161, No. 1-2, 96-106 (2013).
1
Distance geometry. Theory, methods, and applications. (to appear). (English)
Berlin: Springer (ISBN 978-1-4614-5127-3/hbk). xix, 410~p. \$~129.00; EUR~101.60 (2013).
2
Recent advances on the discretizable molecular distance geometry problem. (English)
Eur. J. Oper. Res. 219, No. 3, 698-706 (2012).
3
A storm of feasibility pumps for nonconvex MINLP. (English)
Math. Program. 136, No. 2 (B), 375-402 (2012).
4
Orbital shrinking. (English)
Mahjoub, A. Ridha (ed.) et al., Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32146-7/pbk). Lecture Notes in Computer Science 7422, 48-58 (2012).
5
12th workshop on algorithmic approaches for transportation modelling, optimization, and systems, ATMOS’12, September 13, 2012, Ljubljana, Slovenia. Selected papers based on the presentations at the workshop. (English)
OASIcs ‒ OpenAccess Series in Informatics 25. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-45-3). xi, 143~p. (2012).
6
A label correcting algorithm for the shortest path problem on a multi-modal route network. (English)
Klasing, Ralf (ed.), Experimental algorithms. 11th international symposium, SEA 2012, Bordeaux, France, June 7‒9, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30849-9/pbk). Lecture Notes in Computer Science 7276, 236-247 (2012).
7
Relaxations of multilinear convex envelopes: dual is better than primal. (English)
Klasing, Ralf (ed.), Experimental algorithms. 11th international symposium, SEA 2012, Bordeaux, France, June 7‒9, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30849-9/pbk). Lecture Notes in Computer Science 7276, 87-98 (2012).
8
Compact relaxations for polynomial programming problems. (English)
Klasing, Ralf (ed.), Experimental algorithms. 11th international symposium, SEA 2012, Bordeaux, France, June 7‒9, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30849-9/pbk). Lecture Notes in Computer Science 7276, 75-86 (2012).
9
Symmetry in mathematical programming. (English)
Lee, Jon (ed.) et al., Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17‒21, 2008. New York, NY: Springer (ISBN 978-1-4614-1926-6/hbk; 978-1-4614-1927-3/ebook). The IMA Volumes in Mathematics and its Applications 154, 263-283 (2012).
10
Bidirectional $A^*$ search on time-dependent road networks. (English)
Networks 59, No. 2, 240-251 (2012).
11
An improved column generation algorithm for minimum sum-of-squares clustering. (English)
Math. Program. 131, No. 1-2(A), 195-220 (2012).
12
UniALT for regular language contrained shortest paths on a multi-modal transportation network. (English)
Caprara, Alberto (ed.) et al., 11th workshop on algorithmic approaches for transportation modelling, optimization, and systems (ATMOS 2011). Selected papers based on the presentations at the workshop, September 8, 2011, Saarbrücken, Germany. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-33-0). OASIcs ‒ OpenAccess Series in Informatics 20, 64-75, electronic only (2011).
13
Improved strategies for branching on general disjunctions. (English)
Math. Program. 130, No. 2 (A), 225-247 (2011).
14
Edge cover by connected bipartite subgraphs. (English)
Ann. Oper. Res. 188, 307-329 (2011).
15
Special issue: Selected papers based on the presentations at the 8th Cologne Twente workshop on graphs and combinatorial optimization, CTW 2009, Paris, France, June 2‒4, 2009. (English)
Discrete Appl. Math. 159, No. 16, 1659-1914 (2011).
16
A branch-and-price algorithm for the risk-equity constrained routing problem. (English)
Pahl, Julia (ed.) et al., Network optimization. 5th international conference, INOC 2011, Hamburg, Germany, June 13‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21526-1/pbk). Lecture Notes in Computer Science 6701, 439-449 (2011).
17
Molecular distance geometry methods: from continuous to discrete. (English)
Int. Trans. Oper. Res. 18, No. 1, 33-51 (2011).
18
On the number of solutions of the discretizable molecular distance geometry problem. (English)
Wang, Weifan (ed.) et al., Combinatorial optimization and applications. 5th international conference, COCOA 2011, Zhangjiajie, China, August 4‒6, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22615-1/pbk). Lecture Notes in Computer Science 6831, 322-342 (2011).
19
Influence of pruning devices on the solution of molecular distance geometry problems. (English)
Pardalos, Panos M. (ed.) et al., Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5‒7, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20661-0/pbk). Lecture Notes in Computer Science 6630, 206-217 (2011).
20
Result 1 to 20 of 106 total
Start
Contact
Print
General Help
