Integer programming and combinatorial optimization : 6th International IPCO Conference, Houston, Texas, June 22-24, 1998 : proceedings
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | , , |
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Schriftenreihe: | Lecture notes in computer science
1412 |
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
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 |
| LEADER | 05040nam a22004337a 4500 | ||
|---|---|---|---|
| 001 | 973038 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN15523434X | ||
| 020 | |a 9783540693468 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a International Conference on Integer Programming and Combinatorial Optimization |n (06 |d :1998 |c :Houston, Tex.). | |
| 245 | 1 | 0 | |a Integer programming and combinatorial optimization : |b 6th International IPCO Conference, Houston, Texas, June 22-24, 1998 : proceedings |c [edited by] Robert E. Bixby, E. Andrew Boyd, Roger Z. Ríos-Mercado. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 1412 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Optimisation combinatoire | ||
| 650 | |a Algorithmes | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Calcul des variations | ||
| 650 | |a Programmation en nombres entiers | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Bixby, Robert E. |4 pbd | |
| 700 | 1 | |a Boyd, E. Andrew. |4 pbd | |
| 700 | 1 | |a Rźos-Mercado, Roger Z. |4 pbd | |
| 776 | 0 | |0 035950013 |t Integer programming and combinatorial optimization |o 6th International IPCO Conference, Houston, Texas, June 22-24, 1998 |o proceedings |f Robert E. Bixby, E. Andrew Boyd, Roger Z. Rios-Mercado, (eds) |d 1998 |c New York |n Springer Verlag |p 1 vol. (IX-435 p.) |s Lecture notes in computer science |z 3-540-64590-X | |
| 776 | 0 | |t Integer Programming and Combinatorial Optimization |b Texte imprimé |z 9783662189962 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-69346-7 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-5BRBQLB7-N |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750630256 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-69346-7 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:753986930 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-69346-7 |z Accès INSA CVL | |
| 997 | |0 973038 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||