Integer programming and combinatorial optimization : 5th International IPCO Conference, Vancouver, Canada, June 3-5, 1996 : proceedings
This volume presents the proceedings of the Fifth Integer Programming and Combinatorial Optimization Conference, IPCO V, held in Vancouver, British Columbia, Canada, in June 1996. The 36 revised papers included in the book were selected from a total of 99 submissions; they highlight recent developme...
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | , , |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
1084 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Integer programming and combinatorial optimization, 5th International IPCO Conference, Vancouver, Canada, June 1996, proceedings, William H. Cunningham, S. Thomas McCormick, Maurice Queyranne (eds.), 1996, Berlin, Springer, 1 vol. (X-504 p.), Lecture notes in computer science, 3-540-61310-2 • Integer Programming and Combinatorial Optimization, Texte imprimé, 9783662185513 |
Sommario:
- Colourful linear programming
- Test sets and inequalities for integer programs
- An optimal, stable continued fraction algorithm for arbitrary dimension
- Algorithms and extended formulations for one and two facility network design
- Integer multicommodity flow problems
- A heuristic algorithm for the set covering problem
- An ?-Relaxation method for generalized separable convex cost network flow problems
- Finding real-valued single-source shortest paths in o(n 3) expected time
- A network-flow technique for finding low-weight bounded-degree spanning trees
- Approximating k-set cover and complementary graph coloring
- On minimum 3-cuts and approximating k-cuts using Cut Trees
- Primal-dual approximation algorithms for feedback problems in planar graphs
- Cone-LP's and semidefinite programs: Geometry and a simplex-type method
- Quadratic knapsack relaxations using cutting planes and semidefinite programming
- A semidefinite bound for mixing rates of Markov chains
- The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases
- On optimizing multiplications of sparse matrices
- Continuous relaxations for Constrained Maximum-Entropy Sampling
- A submodular optimization problem with side constraints
- Convexity and Steinitz's exchange property
- On ideal clutters, metrics and multiflows
- A supermodular relaxation for scheduling with release dates
- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
- Implementation of a linear time algorithm for certain generalized traveling salesman problems
- On dependent randomized rounding algorithms
- Coloring bipartite hypergraphs
- Improved randomized approximation algorithms for lot-sizing problems
- Minimizingtotal completion time in a two-machine flowshop: Analysis of special cases
- A new approach to computing optimal schedules for the job-shop scheduling problem
- Optimal on-line algorithms for single-machine scheduling
- The strongest facets of the acyclic subgraph polytope are unknown
- Transitive packing
- A polyhedral approach to the feedback vertex set problem
- Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time
- Separating maximally violated comb inequalities in planar graphs
- The travelling salesman and the PQ-tree.