(Message inbox:11)
Return-Path:
Received: from CS.CMU.EDU by MISSING.LINK.CS.CMU.EDU id aa01642;
7 Feb 96 3:35 EST
Received: from hearn.nic.surfnet.nl by CS.CMU.EDU id aa07217;
7 Feb 96 3:34:17 EST
Received: from HEARN.NIC.SURFNET.NL by HEARN.nic.SURFnet.nl (IBM VM SMTP V2R2)
with BSMTP id 5021; Wed, 07 Feb 96 09:32:49 +0100
Received: from NIC.SURFNET.NL (NJE origin LISTSERV@HEARN) by HEARN.NIC.SURFNET.NL (LMail V1.2a/1.8a) with BSMTP id 6204; Wed, 7 Feb 1996 09:32:36 +0100
Received: from NIC.SURFNET.NL by NIC.SURFNET.NL (LISTSERV release 1.8b) with
NJE id 5439 for DMA-LIST@NIC.SURFNET.NL; Wed, 7 Feb 1996 09:32:23
+0100
Received: from HEARN (NJE origin SMTP@HEARN) by HEARN.NIC.SURFNET.NL (LMail
V1.2a/1.8a) with BSMTP id 6186; Wed, 7 Feb 1996 09:32:16 +0100
Received: from utmfu0.math.utwente.nl by HEARN.nic.SURFnet.nl (IBM VM SMTP
V2R2) with TCP; Wed, 07 Feb 96 09:32:13 +0100
Received: by utmfu0.math.utwente.nl ($Revision: 1.36.108.11 $/16.2) id
AA127671892; Wed, 7 Feb 1996 09:31:32 +0100
Full-Name: DMANET
Mailer: Elm [revision: 66.36.1.1]
Approved-By: DMANET
Message-ID: <199602070831.AA127671892@utmfu0.math.utwente.nl>
Date: Wed, 7 Feb 1996 09:31:30 MET
Reply-To: quey@acme.commerce.ubc.ca
Sender: DMANET
From: DMANET
Subject: IPCO V Conference Program (text)
To: Multiple recipients of list DMA-LIST
Program of the IPCO V Conference
INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION
Vancouver, June 3-5, 1996
Session 1 - Integer Programming Theory
I. Barany and S. Onn, ``Colourful linear programming"
R. Thomas and R. Weismantel, ``Test sets and inequalities for
integer programs"
C. Roessner and C.P. Schnorr, ``An optimal, stable continued
fraction algorithm for arbitrary dimension"
Session 2 - Integer Programming Models
S. Chopra, I. Gilboa and S.T. Sastry, ``Algorithms and extended
formulations for one and two facility network design"
C. Barnhart, C. Hane and P. Vance, ``Integer multicommodity flow
problems"
A. Caprara, M. Fischetti and P. Toth, ``A heuristic algorithm for
the set covering problem"
Session 3 - Network Flow Algorithms
D.P. Bertsekas and P. Tseng, ``An epsilon-relaxation method for
generalized separable convex cost network flow problems"
S.G. Kollipoulos and C. Stein, ``Finding real-valued single-source
shortest paths in $o(n^3)$ expected time"
S.P. Fekete, S. Khuller, M. Klemmstein, B. Raghvachari and N. Young,
``A network flow technique for finding low-weight bounded-degree
spanning trees"
Session 4 - Approximation Algorithms
M.M. Halldorsson, ``Approximating $k$-set cover and complementary
graph coloring"
S. Kapoor, ``On minimum 3-cuts and approximating $k$-cuts using cut trees"
M.X. Goemans and D.P. Williamson, ``Primal-dual approximation
algorithms for feedback problems in planar graphs"
Session 5 - Semi-definite Methods
G. Pataki, ``Cone-LP's and semidefinite programs: geometry, basic
solutions and a simplex-type method"
C. Helmberg, F. Rendl and R. Weismantel, ``Quadratic knapsack
relaxations using cutting planes and semidefinite programming"
N. Kahale, ``A semidefinite bound for mixing rates of Markov chains"
Session 6 - Matrix Models
R.E. Burkard, E. Cela, G. Rote and G.J. Woeginger, ``The quadratic
assignment problem with an anti-Monge and a Toeplitz matrix:
easy and hard cases"
E. Cohen, ``On optimizing multiplications of sparse matrices"
K. Anstreicher, M. Fampa, J. Lee and J. Williams, ``Continuous
relaxations for constrained maximum entropy sampling"
Session 7 - Set Systems and Submodularity
D. Hartvigsen, ``A submodular optimization problem with side constraints"
K. Murota, ``Convexity and Steinitz's exchange property"
B. Novick and A. Sebo, ``On ideal clutters, metrics and multiflows"
Session 8 - Scheduling I
M. Goemans, ``A supermodular relaxation for scheduling with release dates"
A.S. Schulz, ``Scheduling to minimize total weighted completion
time: performance guarantees of LP-based heuristics and lower bounds"
N. Simonetti and E. Balas, ``Implementation of a linear time
algorithm for certain generalized travelling salesman problems"
Session 9 - Probabilistic Methods
D. Bertsimas, C. Teo and R. Vohra, ``On dependent randomized rounding
algorithms"
H. Chen and A. Frieze, ``Coloring bipartite hypergraphs"
C. Teo and D. Bertsimas, ``Improved randomized approximation
algorithms for lotsizing problems"
Session 10 - Scheduling II
J. A. Hoogeveen and T. Kawaguchi, ``Minimizing total completion
time in a two-machine flowshop: analysis of special cases"
P. Martin and D.B. Shmoys, ``A new approach to computing optimal
schedules for the job shop scheduling problem"
J. A. Hoogeveen and A.P.A. Vestjens, ``Optimal on-line algorithms
for single-machine scheduling"
Session 11 - Polyhedral Methods
M.X. Goemans and L.A. Hall, ``The strongest facets of the acyclic
subgraph polytope are unknown"
A.S. Schulz and R. Mueller, ``Transitive packing"
M. Funke and G. Reinelt, ``A polyhedral approach to the feedback
vertex set problem"
Session 12 - The Travelling Salesman Problem
B. Carr, ``Separating over classes of TSP inequalities defined by 0
node-lifting in polynomial time"
L. Fleischer and E. Tardos, ``Separating maximally violated comb
inequalities in planar graphs"
V.G. Deineko and G.J. Woeginger, ``The travelling salesman and PQ trees"
-----------------------------------------------------------
For more information, see the IPCO V web page:
http://acme.commerce.ubc.ca/stmv/ipco.html
Maurice Queyranne
Faculty of Commerce
University of British Columbia
Vancouver, B.C.
Canada V6T 1Z2
Tel: (604) 822-8429
Fax: (604) 822-9574
E-mail: quey@acme.commerce.ubc.ca
WWW: http://acme.commerce.ubc.ca/quey/queyranne.html
--
******************************************************
Contributions to be spread via DMANET are submitted to
DMANET@math.utwente.nl
Replies to a message carried on DMANET should NOT be
addressed to DMANET but to the original sender. The
original sender, however, is invited to prepare an
update of the replies received and to communicate it
via DMANET.
DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)