Integer programming and combinatorial optimization : 7th International IPCO Conference, Graz, Austria, June 9-11, 1999 : proceedings
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | , , |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
1610 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'e diteur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
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, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, proceedings, Gérard Cornuéjols, Rainer E. Burkard, Gerhard J. Woeginger (eds.), 1999, New York, Springer, 1 vol. (IX-452 p.), Lecture notes in computer science, 3-540-66019-4 • Integer Programming and Combinatorial Optimization, Texte imprimé, 9783662178744 |
Obsah:
- Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
- Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts
- Solving the Convex Cost Integer Dual Network Flow Problem
- Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem
- Valid Inequalities for Problems with Additive Variable Upper Bounds
- A Min-Max Theorem on Feedback Vertex Sets (Preliminary Version)
- On the Separation of Maximally Violated mod-k Cuts
- Improved Approximation Algorithms for Capacitated Facility Location Problems
- Optimal 3-Terminal Cuts and Linear Programming
- Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem
- Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
- Universally Maximum Flow with Piecewise-Constant Capacities
- Critical Extreme Points of the 2-Edge Connected Spannning Subgraph Polytope
- An Orientation Theorem with Parity Conditions
- Parity Constrained k-Edge-Connected Orientations
- Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
- On the Chvátal Rank of Certain Inequalities
- The Square-Free 2-Factor Problem in Bipartite Graphs
- The m-Cost ATSP
- A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem
- Edge-Splitting Problems with Demands
- Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors
- Optimal Compaction of Orthogonal Grid Drawings (Extended Abstract)
- On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms
- Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
- Approximation Algorithms for a Directed Network Design Problem
- Optimizing over AllCombinatorial Embeddings of a Planar Graph (Extended Abstract)
- A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts
- Scheduling Two Machines with Release Times
- An Introduction to Empty Lattice Simplices
- On Optimal Ear-Decompositions of Graphs
- Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications (Extended Abstract)
- Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut.