default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2. IPCO 1992: Pittsburgh, PA, USA
- Egon Balas, Gérard Cornuéjols, Ravi Kannan:
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, USA, May 1992. Carnegie Mellon University 1992 - Michel X. Goemans:
Polyhedral Description of Trees and Arborescences. IPCO 1992: 1-14 - Sunil Chopra:
The K-Edge Connected Spanning Subgraph Polyhedron. IPCO 1992: 15-29 - Francisco Barahona, Ali Ridha Mahjoub:
On 2-Connected Subgraph Polytopes. IPCO 1992: 30-43 - Dorit S. Hochbaum, Joseph Naor:
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality. IPCO 1992: 44-59 - Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano:
Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. IPCO 1992: 61-71 - Martin E. Dyer, Alan M. Frieze:
Random Walks, Totally Unimodular Matrices and a Randomised Dual Simplex Algorithm. IPCO 1992: 72-84 - András Frank, Alexander V. Karzanov, András Sebö:
On Multiflow Problems. IPCO 1992: 85-101 - Farhad Shahrokhi, László A. Székely:
Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of Symmetry. IPCO 1992: 102-113 - Xiaotie Deng, Pavol Hell, Jing Huang:
Recognition and Representation of Proper Circular Arc Graphs. IPCO 1992: 114-121 - J. A. Hoogeveen, H. Oosterhout, Steef L. van de Velde:
New Lower and Upper Bounds for Scheduling Around a Small Common Due Date. IPCO 1992: 122-135 - Jean B. Lasserre, Maurice Queyranne:
Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling. IPCO 1992: 136-149 - Yves Pochet, Laurence A. Wolsey:
Network Design with Divisible Capacities: Aggregated Flow and Knapsack Subproblems. IPCO 1992: 150-164 - Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão:
Mixed-Integer Column Generation Algorithms and the Probabilistic Maximum Satisfiability Problem. IPCO 1992: 165-180 - Silvano Martello, François Soumis, Paolo Toth:
An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines. IPCO 1992: 181-200 - Paolo Nobili, Antonio Sassano:
A Separation Routine for the Set Covering Polytope. IPCO 1992: 201-219 - Endre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks:
A Complexity Index for Satisfiability Problems. IPCO 1992: 220-226 - Guoliang Xue, J. Ben Rosen, Panos M. Pardalos:
A Polynomial Time Dual Algorithm for the Euclidean Multifacility Location Problem. IPCO 1992: 227-236 - Alexander A. Ageev:
A Criterion of Polynomial-Time Solvability for the Network Location Problem. IPCO 1992: 237-245 - William H. Cunningham, Fan Zhang:
Subgraph Degree-Sequence Polyhedra. IPCO 1992: 246-259 - Matteo Fischetti:
Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope. IPCO 1992: 260-273 - Monique Laurent, Svatopluk Poljak:
The Metric Polytope. IPCO 1992: 274-286 - Paul Helman, Bernard M. E. Moret, Henry D. Shapiro:
An Exact Characterization of Greedy Structures. IPCO 1992: 287-297 - Partha P. Bhattacharya, Leonidas Georgiadis, Pantelis Tsoucas:
Extended Polymatroids: Properties and Optimization. IPCO 1992: 298-315 - Alexander I. Barvinok:
Optimization Problems on Matroids and Exponential Sums. IPCO 1992: 316-333 - Péter L. Erdös, László A. Székely:
Algorithms and Min-max Theorems for Certain Multiway Cuts. IPCO 1992: 334-345 - Cor A. J. Hurkens:
Nasty TSP Instances for Farthest Insertion. IPCO 1992: 346-352 - András Sebö:
Forcing Colorations and the Strong Perfect Graph Conjecture. IPCO 1992: 353-366 - Lov K. Grover:
Fast Parallel Algorithms for Bipartite Matching. IPCO 1992: 367-384 - Farid Alizadeh:
Combinatorial Optimization with Semi-Definite Matrices. IPCO 1992: 385-405 - Narendra Karmarkar, S. A. Thakur:
An Interior Point Approach to a Tensor Optimization Problem with Application to Upper Bounds in Integer Quadratic Optimization Problems. IPCO 1992: 406-420 - Daniel Bienstock:
A Lot-Sizing Problem on Trees, Related to Network Design. IPCO 1992: 421-434 - Dimitris Bertsimas, James B. Orlin:
A Technique for Speeding up the Solution of the Lagrangian Dual. IPCO 1992: 435-452 - Alan M. Frieze, Richard M. Karp, Bruce A. Reed:
When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? IPCO 1992: 453-461
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-25 00:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
