default search action
Discrete Optimization, Volume 18
Volume 18, November 2015
- Hiroshi Hirai:
L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem. 1-37 - Ante Custic, Bettina Klinz, Gerhard J. Woeginger:
Geometric versions of the three-dimensional assignment problem under general norms. 38-55 - Ralf Borndörfer, Marika Karbstein:
Metric inequalities for routings on direct connections with application to line planning. 56-73 - Alper Atamtürk, Avinash Bhardwaj:
Supermodular covering knapsack polytope. 74-86 - Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende, Tallys H. Yunes:
Arc-based integer programming formulations for three variants of proportional symbol maps. 87-110 - Alewyn P. Burger, Anton Pierre de Villiers, Jan H. van Vuuren:
Edge criticality in secure graph domination. 111-122 - Grit Claßen, Arie M. C. A. Koster, Anke Schmeink:
The multi-band robust knapsack problem - A dynamic programming approach. 123-149 - S. Ahmad Hosseini:
Time-dependent optimization of a multi-item uncertain supply chain network: A hybrid approximation algorithm. 150-167 - Sibel B. Sonuc, J. Cole Smith, Illya V. Hicks:
A branch-and-price-and-cut method for computing an optimal bramble. 168-188 - Egon Balas, Tamás Kis:
Intersection cuts - standard versus restricted. 189-192 - Lena Hupp, Laura Klein, Frauke Liers:
An exact solution method for quadratic matching: The one-quadratic-term technique and generalisations. 193-216 - Louis Boguchwal:
Shortest path algorithms for functional environments. 217-251
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.