----------------------------------------------------------------
IPCO II, 1992 (Pittsburgh): List of accepted papers
----------------------------------------------------------------
A.A. Ageev
A criterion for polynomial time solvability for the
network location problem
F. Alizadeh
Combinatorial optimization with semi-definite matrices
F. Barahona, A.R. Mahjoub
On 2-connected subgraph polytopes
A.I. Barvinok
Optimization problems on matroids and exponential sums
D. Bertsimas, J.B. Orlin
A technique for speeding up the solution of the Lagrangian Dual
P.P. Bhattacharya, L. Georgiadis, P. Tsoucas
Extended polymatroids: Properties and optimization
D. Bienstock
A lot-sizing problem on trees, related to network design
E. Boros, Y. Crama, P.L. Hammer, M. Saks
A complexity index for satisfiability problems
S. Chopra
The k-edge connected spanning subgraph polyhedron
W.H. Cunningham, F. Zhang
Subgraph degree sequence polyhedra
X. Deng, P. Hell, J. Huang
Recognition and representation of proper circular arc graphs
M. Dyer, A. Frieze
Random walks, totally unimodular matrices, and a
randomised dual Simplex algorithm
P.L. Erdos, L.A. Szekely
Algorithms and min-max theorems for certain multiway cuts
M. Fischetti
Three facet-lifting theorems for the asymmetric travelling
salesman polytope
A. Frank, A.V. Karzanov, A. Sebo
On multiflow problems
A. Frieze, R.M. Karp, B. Reed
When is the assignment bound tight for the asymmetric
traveling salesman problem?
M.X. Goemans
Polyhedral description of trees and arborescences
L.K. Grover
Fast parallel algorithms for bipartite matching
P. Hansen, B. Jaumard, M. Poggi de Aragao
Mixed-integer column generation algorithms and the
probabilistic maximum satisfiability problem
P. Helman, B.M.E. Moret, H.D. Shapiro
An exact characterization of greedy structures
D.S. Hochbaum, J. Naor
Simple and fast algorithms for linear and integer programs
with two variables per inequality
J.A. Hoogeveen, H. Oosterhout, S.L. van de Velde
New lower and upper bounds for scheduling around a
small common due date
C.A.J. Hurkens
Nasty TSP instances for farthest insertion
N. Kanamaru, T. Nishizeki, T. Asano
Efficient enumeration of grid points in a polygon and
its application to integer programming
N.K. Karmarkar, S.A. Thakur
An interior point approach to a tensor optimization problem
with application to upper bounds in integer quadratic
optimization problems
J.B. Lasserre, M. Queyranne
Generic scheduling polyhedra and a new mixed-integer
formulation for single machine scheduling
M. Laurent, S. Poljak
The metric polytope
S. Martello, F. Soumis, P.Toth
An exact algorithm for makespan minimization on unrelated
parallel machines
P. Nobili, A. Sassano
A separation routine for the set covering polytope
Y. Pochet, L.A. Wolsey
Network design with divisible capacities: Aggregated flow
and knapsack subproblems
A. Sebo
Forcing colorations an the strong perfect graph conjecture
F. Shahrokhi, L.A. Szekely
Effective lower bounds for crossing number, bisection width,
and balanced vertex separator in terms of symmetry
G.L. Xue, J.B. Rosen, P.M. Pardalos
A polynomial time dual algorithm for the Euclidean
multifacility location problem