The SCEAS System
Navigation Menu

Conferences in DBLP

Integer Programming and Combinatorial Optimization (IPCO) (ipco)
1990 (conf/ipco/1990)

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. Egon Balas
    Finding Out Whether a Valid Inequality is Facet Defining. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:45-59 [Conf]
  6. Daniel Bienstock
    Some Provably Hard Crossing Number Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:61-83 [Conf]
  7. E. Andrew Boyd
    Polyhedral Results for the Precedence-Constrained Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:85-100 [Conf]
  8. 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]
  9. 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]
  10. Sunil Chopra, Giovanni Rinaldi
    The Graphical Asymmetric Traveling Salesman Polyhedron. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:129-145 [Conf]
  11. Michele Conforti, Gérard Cornuéjols
    A Decomposition Theorem for Balanced Matrices. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:147-169 [Conf]
  12. Michel Deza, Monique Laurent
    New Results on Facets of the Cut Cone. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:171-184 [Conf]
  13. 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]
  14. Martin E. Dyer, Alan M. Frieze
    Probabilistic Analysis of the Generalised Assignment Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:189-200 [Conf]
  15. 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]
  16. András Frank
    Conservative Weightings and Ear-Decompositions of Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:217-229 [Conf]
  17. A. A. Fridman, Eugene Levner
    A Survey of Some Results in Discrete Optimisation. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:231-235 [Conf]
  18. 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]
  19. Leslie A. Hall, David B. Shmoys
    Near-Optimal Sequencing with Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:249-260 [Conf]
  20. 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]
  21. Winfried Hochstättler
    Shellability of Oriented Matroids. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:275-281 [Conf]
  22. J. A. Hoogeveen
    Minimizing Maximum Earliness and Maximum Lateness on a Single Machine. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:283-295 [Conf]
  23. 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]
  24. 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]
  25. 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]
  26. Narendra Karmarkar
    An Interior-Point Approach to NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:351-366 [Conf]
  27. Samir Khuller, Joseph Naor
    Flow in Planar Graphs with Vertex Capacities. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:367-384 [Conf]
  28. Shmuel Onn
    On the Radon Number of the Integer Lattice. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:385-396 [Conf]
  29. András Recski, Frank Strzyzewski
    Vertex Disjoint Channel Routing on Two Layers. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:397-405 [Conf]
  30. Bruce A. Reed
    Perfection, Parity, Planarity, and Packing Paths. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:407-419 [Conf]
  31. Michael H. Schneider, Mark E. Hartmann, Hans Schneider
    Max-Balanced Flows. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:421-429 [Conf]
  32. András Sebö
    Hilbert Bases, Caratheodory's Theorem and Combinatorial Optimization. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:431-455 [Conf]
  33. 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]
  34. S. Sridhar, R. Chandrasekaran
    Integer Solution to Synthesis of Communication Networks. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:467-483 [Conf]
  35. Michael A. Trick
    Scheduling Multiple Variable-Speed Machines. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:485-494 [Conf]
  36. Steef L. van de Velde
    Dual Decomposition of Single Machine Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:495-507 [Conf]
  37. 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]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002