Integer programming and combinatorial optimization : 6th International IPCO Conference, Houston, Texas, June 22-24, 1998 : proceedings
Bewaard in:
| Coauteur: | |
|---|---|
| Andere auteurs: | , , |
| Formaat: | Livre numérique |
| Taal: | Anglais |
| Gepubliceerd in: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Reeks: | Lecture notes in computer science
1412 |
| Onderwerpen: | |
| Online toegang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Opmerking: |
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, 6th International IPCO Conference, Houston, Texas, June 22-24, 1998, proceedings, Robert E. Bixby, E. Andrew Boyd, Roger Z. Rios-Mercado, (eds), 1998, New York, Springer Verlag, 1 vol. (IX-435 p.), Lecture notes in computer science, 3-540-64590-X • Integer Programming and Combinatorial Optimization, Texte imprimé, 9783662189962 |
Inhoudsopgave:
- 0,1 Matrices, Matroids
- The Packing Property
- A Characterization of Weakly Bipartite Graphs
- Bipartite Designs
- Characterizing Noninteger Polyhedra with 0 1 Constraints
- A Theorem of Truemper
- The Generalized Stable Set Problem for Claw-Free Bidirected Graphs
- On a Min-max Theorem of Cacti
- Edge Connectivity
- Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs
- A New Bound for the 2-Edge Connected Subgraph Problem
- An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs
- Algorithms
- Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width
- Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs
- Approximation Algorithms for the Mixed Postman Problem
- Improved Approximation Algorithms for Uncapacitated Facility Location
- The Maximum Traveling Salesman Problem Under Polyhedral Norms
- Integer Programming Applications
- Polyhedral Combinatorics of Benzenoid Problems
- Consecutive Ones and a Betweenness Problem in Computational Biology
- Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables
- Integer Programming Computation
- The Intersection of Knapsack Polyhedra and Extensions
- New Classes of Lower Bounds for Bin Packing Problems
- Solving Integer and Disjunctive Programs by Lift and Project
- A Class of Hard Small 0 1 Programs
- Network Flows
- Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time
- Simple Generalized Maximum Flow Algorithms
- The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem
- An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow
- Scheduling
- Non-approximability Resultsfor Scheduling Problems with Minsum Criteria
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
- An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
- On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems
- Quadratic Assignment Problems
- Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations
- Incorporating Inequality Constraints in the Spectral Bundle Method.