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