default search action
Discrete Optimization, Volume 21
Volume 21, August 2016
- Diego Delle Donne, Javier Marenco:
Polyhedral studies of vertex coloring problems: The standard formulation. 1-13 - János Balogh, József Békési, Gábor Galambos, György Dósa, Zhiyi Tan:
Lower bound for 3-batched bin packing. 14-24 - Michele Barbato, Roland Grappe, Mathieu Lacroix, Roberto Wolfler Calvo:
Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks. 25-41 - Agostinho Agra, Mahdi Doostmohammadi, Cid C. de Souza:
Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph. 42-70 - Steffen Borgwardt, Shmuel Onn:
Efficient solutions for weight-balanced partitioning problems. 71-84 - Frauke Liers, Alexander Martin, Susanne Pape:
Binary Steiner trees: Structural results and an exact solution approach. 85-117 - John Martinovic, Guntram Scheithauer:
Integer rounding and modified integer rounding for the skiving stock problem. 118-130 - Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos:
Lifted, projected and subgraph-induced inequalities for the representatives k-fold coloring polytope. 131-156
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.