default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1. IPCO 1990: Waterloo, Ontorio, Canada
- Ravi Kannan, William R. Pulleyblank:
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, Waterloo, Ontorio, Canada, May 28-30 1990. University of Waterloo Press 1990, ISBN 0-88898-099-X - Alexander A. Ageev, Vladimir L. Beresnev:
Polynomially Solvable Cases of the Simple Plant Location Problem. IPCO 1990: 1-6 - Edward J. Anderson, Michael C. Ferris:
A Genetic Algorithm for the Assembly Line Balancing Problem. IPCO 1990: 7-18 - Norbert Ascheuer, Laureano F. Escudero, Martin Grötschel, Mechthild Stoer:
On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem. IPCO 1990: 19-28 - Franz Aurenhammer, Johann Hagauer, Wilfried Imrich:
Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge. IPCO 1990: 29-44 - Egon Balas:
Finding Out Whether a Valid Inequality is Facet Defining. IPCO 1990: 45-59 - Daniel Bienstock:
Some Provably Hard Crossing Number Problems. IPCO 1990: 61-83 - E. Andrew Boyd:
Polyhedral Results for the Precedence-Constrained Knapsack Problem. IPCO 1990: 85-100 - Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli:
Modular Arithmetic and Randomization for Exact Matroid Problems. IPCO 1990: 101-113 - Chung-Kuan Cheng, T. C. Hu:
Ancestor Tree for Arbitrary Multi-Terminal Cut Functions. IPCO 1990: 115-127 - Sunil Chopra, Giovanni Rinaldi:
The Graphical Asymmetric Traveling Salesman Polyhedron. IPCO 1990: 129-145 - Michele Conforti, Gérard Cornuéjols:
A Decomposition Theorem for Balanced Matrices. IPCO 1990: 147-169 - Michel Deza, Monique Laurent:
New Results on Facets of the Cut Cone. IPCO 1990: 171-184 - E. A. Dinic:
The Fastest Algorithm for the Pert Problem with AND-and OR-Nodes (The New-Product-New-Technology Problem). IPCO 1990: 185-187 - Martin E. Dyer, Alan M. Frieze:
Probabilistic Analysis of the Generalised Assignment Problem. IPCO 1990: 189-200 - Jean Fonlupt, András Sebö:
On the Clique-Rank and the Coloration of Perfect Graphs. IPCO 1990: 201-216 - András Frank:
Conservative Weightings and Ear-Decompositions of Graphs. IPCO 1990: 217-229 - A. A. Fridman, Eugene Levner:
A Survey of Some Results in Discrete Optimisation. IPCO 1990: 231-235 - Scott W. Hadley, Franz Rendl, Henry Wolkowicz:
Bounds for the Quadratic Assignment Problems Using Continuous Optimization Techniques. IPCO 1990: 237-248 - Leslie A. Hall, David B. Shmoys:
Near-Optimal Sequencing with Precedence Constraints. IPCO 1990: 249-260 - Dorit S. Hochbaum:
On the Impossibility of Strongly Polynomial Algorithms for the Allocation Problem and its Extensions. IPCO 1990: 261-273 - Winfried Hochstättler:
Shellability of Oriented Matroids. IPCO 1990: 275-281 - J. A. Hoogeveen:
Minimizing Maximum Earliness and Maximum Lateness on a Single Machine. IPCO 1990: 283-295 - Wen-Lian Hsu:
O(m\cdotn) Isomorphism Algorithms for Circular-Arc Graphs and Circle Graphs. IPCO 1990: 297-311 - Brigitte Jaumard, Pierre Hansen, Marcus Poggi de Aragão:
Column Generation Methods for Probabilistic Logic. IPCO 1990: 313-331 - Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende:
Computational Experience with an Interior Point Algorithm on the Satisfiability Problem. IPCO 1990: 333-349 - Narendra Karmarkar:
An Interior-Point Approach to NP-Complete Problems. IPCO 1990: 351-366 - Samir Khuller, Joseph Naor:
Flow in Planar Graphs with Vertex Capacities. IPCO 1990: 367-384 - Shmuel Onn:
On the Radon Number of the Integer Lattice. IPCO 1990: 385-396 - András Recski, Frank Strzyzewski:
Vertex Disjoint Channel Routing on Two Layers. IPCO 1990: 397-405 - Bruce A. Reed:
Perfection, Parity, Planarity, and Packing Paths. IPCO 1990: 407-419 - Michael H. Schneider, Mark E. Hartmann, Hans Schneider:
Max-Balanced Flows. IPCO 1990: 421-429 - András Sebö:
Hilbert Bases, Caratheodory's Theorem and Combinatorial Optimization. IPCO 1990: 431-455 - Edward C. Sewell, Leslie E. Trotter Jr.:
Stability Critical Graphs and Even Subdivisions of K_4. IPCO 1990: 457-466 - S. Sridhar, R. Chandrasekaran:
Integer Solution to Synthesis of Communication Networks. IPCO 1990: 467-483 - Michael A. Trick:
Scheduling Multiple Variable-Speed Machines. IPCO 1990: 485-494 - Steef L. van de Velde:
Dual Decomposition of Single Machine Scheduling Problems. IPCO 1990: 495-507 - Vijay V. Vazirani:
A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(\surdVE) General Graph Matching Algorithm. IPCO 1990: 509-530
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 2026-01-06 22:48 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:
