|
Conferences in DBLP
- Karen Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink
Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:1-16 [Conf]
- Alexander A. Ageev, Maxim Sviridenko
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:17-30 [Conf]
- Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
Solving the Convex Cost Integer Dual Network Flow Problem. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:31-44 [Conf]
- Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.
Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:45-59 [Conf]
- Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh
Valid Inequalities for Problems with Additive Variable Upper Bounds. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:60-72 [Conf]
- Mao-cheng Cai, Xiaotie Deng, Wenan Zang
A Min-Max Theorem on Feedback Vertex Sets. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:73-86 [Conf]
- Alberto Caprara, Matteo Fischetti, Adam N. Letchford
On the Separation of Maximally Violated mod-k Cuts. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:87-98 [Conf]
- Fabián A. Chudak, David P. Williamson
Improved Approximation Algorithms for Capacitated Facility Location Problems. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:99-113 [Conf]
- William H. Cunningham, Lawrence Tang
Optimal 3-Terminal Cuts and Linear Programming. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:114-125 [Conf]
- Dragos Cvetkovic, Mirjana Cangalovic, Vera Kovacevic-Vujcic
Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:126-136 [Conf]
- Friedrich Eisenbrand, Andreas S. Schulz
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:137-150 [Conf]
- Lisa Fleischer
Universally Maximum Flow with Piecewise-Constant Capacities. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:151-165 [Conf]
- Jean Fonlupt, Ali Ridha Mahjoub
Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:166-182 [Conf]
- András Frank, Tibor Jordán, Zoltán Szigeti
An Orientation Theorem with Parity Conditions. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:183-190 [Conf]
- András Frank, Zoltán Király
Parity Constrained k-Edge-Connected Orientations. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:191-201 [Conf]
- Eran Halperin, Uri Zwick
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:202-217 [Conf]
- Mark E. Hartmann, Maurice Queyranne, Yaoguang Wang
On the Chvátal Rank of Certain Inequalities. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:218-233 [Conf]
- David Hartvigsen
The Square-Free 2-Factor Problem in Bipartite Graphs. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:234-241 [Conf]
- Christoph Helmberg
The m-Cost ATSP. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:242-258 [Conf]
- Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:259-272 [Conf]
- Tibor Jordán
Edge-Splitting Problems with Demands. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:273-288 [Conf]
- Kenji Kashiwabara, Masataka Nakamura, Takashi Takabatake
Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:289-303 [Conf]
- Gunnar W. Klau, Petra Mutzel
Optimal Compaction of Orthogonal Grid Drawings. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:304-319 [Conf]
- Philip N. Klein, Neal E. Young
On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:320-327 [Conf]
- Stavros G. Kolliopoulos, Clifford Stein
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:328-344 [Conf]
- Vardges Melkonian, Éva Tardos
Approximation Algorithms for a Directed Network Design Problem. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:345-360 [Conf]
- Petra Mutzel, René Weiskircher
Optimizing over All Combinatorial Embeddings of a Planar Graph. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:361-376 [Conf]
- Hiroshi Nagamochi, Toshihide Ibaraki
A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:377-390 [Conf]
- John Noga, Steven S. Seiden
Scheduling Two Machines with Release Times. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:391-399 [Conf]
- András Sebö
An Introduction to Empty Lattice Simplices. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:400-414 [Conf]
- Zoltán Szigeti
On Optimal Ear-Decompositions of Graphs. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:415-428 [Conf]
- Chung-Piaw Teo, Jay Sethuraman, Wee-Peng Tan
Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:429-438 [Conf]
- Eduardo Uchoa, Marcus Poggi de Aragão
Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut. [Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:439-452 [Conf]
|