|
|
Mathematical Programming, Series B |
Guest
Editors:
Michael Jünger mjuenger@informatik.uni-koeln.de
Thomas M. Liebling thomas.liebling@epfl.ch
Denis Naddef naddef@imag.fr
William R. Pulleyblank wp@us.ibm.com
Gerhard Reinelt gerhard.reinelt@informatik.uni-heidelberg.de
Giovanni Rinaldi rinaldi@iasi.cnr.it
Laurence A. Wolsey wolsey@core.ucl.ac.be
Papers:
J.
F. Maurras
Separation
from membership and folklore
I.
M. Bomze, F. Frommelt, M. Locatelli
Copositivity
cuts for improving SDP bounds on the clique number
K.
M. Anstreicher, S. Burer
Computable
representations for convex hulls of low-dimensional quadratic forms
T.
Bogart, A. Raymond, R.R. Thomas
Small
Chvatal rank
K.
Kaparis, A. N. Letchford
Separation
algorithms for 0-1 knapsack polytopes
A.
Caprara, A. N. Letchford
New
techniques for cost sharing in combinatorial optimization games
A.
Prodon, S. DeNegre, T. M. Liebling
Locating
leak detecting sensors in a water distribution network by solving
prize-collecting Steiner arborescence problems
S.
S. Dey, L. A. Wolsey
Two
row mixed integer cuts via lifting
M.
Fischetti, D. Salvagnin, A. Zanette
A
note on the selection of benders' cuts
O.
Günlük, J. Linderoth
Perspective
reformulations of mixed integer nonlinear programs with indicator variables
V. Cacchiani,
A. Caprara, P. Toth
Solving
a real-world train unit assignment problem
Y.
Berstein, J. Lee, S. Onn, R. Weismantel
Parametric
nonlinear discrete optimization over well-described sets and matroid
intersections
J.
R. Correa, C. G. Fernandes, Y. Wakabayashi
Approximating
a class of combinatorial problems with rational objective function
A.
R. Mahjoub, S. T. McCormick
Max
flow and min cut with bounded-length paths: complexity, algorithms, and
approximation
A.
Lodi, E. Malaguti, N. E. Stier-Moses
Efficient
and fair routing for mesh networks
M.
Martens, S. T. McCormick, M. Queyranne
Separation,
dimension, and facet algorithms for node flow polyhedra
A.
Musitelli
Recognizing
binet matrices
A.
Saxena, P. Bonami, J. Lee
Convex
relaxations of non-convex mixed integer quadratically constrained programs:
extended formulations
M.
Chimani, M. Kandyba, I. Ljubić, P. Mutzel
Orientation-based
models for {0,1,2}-survivable network design
M.
Skutella, A. Weber
On the
dominant of the s-t-cut polytope
K.
Andersen, Q. Louveaux, R. Weismantel
Mixed-integer
sets from two rows of two adjacent simplex bases
M.
Tawarmalani, J.-P. P. Richard, K. Chung
Strong
valid inequalities for orthogonal disjunctions and polynomial covering sets
C.
Buchheim, F. Liers, M. Oswald
Speeding
up IP-based algorithms for constrained quadratic 0-1 optimization