| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A note on the selection of Benders’ cuts
|
Fischetti, Matteo
|
|
2010
|
124 |
1-2 |
p. 175-182
|
article
|
| 2 |
Approximating a class of combinatorial problems with rational objective function
|
Correa, José R.
|
|
2010
|
124 |
1-2 |
p. 255-269
|
article
|
| 3 |
Computable representations for convex hulls of low-dimensional quadratic forms
|
Anstreicher, Kurt M.
|
|
2010
|
124 |
1-2 |
p. 33-43
|
article
|
| 4 |
Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations
|
Saxena, Anureet
|
|
2010
|
124 |
1-2 |
p. 383-411
|
article
|
| 5 |
Copositivity cuts for improving SDP bounds on the clique number
|
Bomze, Immanuel M.
|
|
2010
|
124 |
1-2 |
p. 13-32
|
article
|
| 6 |
Efficient and fair routing for mesh networks
|
Lodi, Andrea
|
|
2010
|
124 |
1-2 |
p. 285-316
|
article
|
| 7 |
Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems
|
Prodon, Alain
|
|
2010
|
124 |
1-2 |
p. 119-141
|
article
|
| 8 |
Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation
|
Mahjoub, A. Ridha
|
|
2010
|
124 |
1-2 |
p. 271-284
|
article
|
| 9 |
Mixed-integer sets from two rows of two adjacent simplex bases
|
Andersen, Kent
|
|
2010
|
124 |
1-2 |
p. 455-480
|
article
|
| 10 |
New techniques for cost sharing in combinatorial optimization games
|
Caprara, Alberto
|
|
2010
|
124 |
1-2 |
p. 93-118
|
article
|
| 11 |
Note on separation from membership, and folklore
|
Maurras, Jean François
|
|
2010
|
124 |
1-2 |
p. 7-11
|
article
|
| 12 |
On the dominant of the s-t-cut polytope: Vertices, facets, and adjacency
|
Skutella, Martin
|
|
2010
|
124 |
1-2 |
p. 441-454
|
article
|
| 13 |
Orientation-based models for {0,1,2}-survivable network design: theory and practice
|
Chimani, Markus
|
|
2010
|
124 |
1-2 |
p. 413-439
|
article
|
| 14 |
Parametric nonlinear discrete optimization over well-described sets and matroid intersections
|
Berstein, Y.
|
|
2010
|
124 |
1-2 |
p. 233-253
|
article
|
| 15 |
Perspective reformulations of mixed integer nonlinear programs with indicator variables
|
Günlük, Oktay
|
|
2010
|
124 |
1-2 |
p. 183-205
|
article
|
| 16 |
Recognizing binet matrices
|
Musitelli, Antoine
|
|
2010
|
124 |
1-2 |
p. 349-381
|
article
|
| 17 |
Separation algorithms for 0-1 knapsack polytopes
|
Kaparis, Konstantinos
|
|
2010
|
124 |
1-2 |
p. 69-91
|
article
|
| 18 |
Separation, dimension, and facet algorithms for node flow polyhedra
|
Martens, Maren
|
|
2010
|
124 |
1-2 |
p. 317-348
|
article
|
| 19 |
Small Chvátal Rank
|
Bogart, Tristram
|
|
2010
|
124 |
1-2 |
p. 45-68
|
article
|
| 20 |
Solving a real-world train-unit assignment problem
|
Cacchiani, Valentina
|
|
2010
|
124 |
1-2 |
p. 207-231
|
article
|
| 21 |
Speeding up IP-based algorithms for constrained quadratic 0–1 optimization
|
Buchheim, Christoph
|
|
2010
|
124 |
1-2 |
p. 513-535
|
article
|
| 22 |
Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
|
Tawarmalani, Mohit
|
|
2010
|
124 |
1-2 |
p. 481-512
|
article
|
| 23 |
Traces of the XII Aussois Workshop on Combinatorial Optimization
|
Jünger, Michael
|
|
2010
|
124 |
1-2 |
p. 1-6
|
article
|
| 24 |
Two row mixed-integer cuts via lifting
|
Dey, Santanu S.
|
|
2010
|
124 |
1-2 |
p. 143-174
|
article
|
Journal description