Integer programming and combinatorial optimization : 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004 : proceedings
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
3064 |
| Matèries: | |
| Accés en línia: | 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, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, proceedings, Daniel Bienstock, George Nemhauser (eds.), Berlin, Springer, 2004, 1 vol. (XI-443 p.), Lecture notes in computer science, 3-540-22113-1 • Integer Programming and Combinatorial Optimization, Texte imprimé, 9783662198117 |
| LEADER | 04886nam a22004457a 4500 | ||
|---|---|---|---|
| 001 | 969092 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155167359 | ||
| 020 | |a 9783540259602 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 082 | |a 519.77 | ||
| 111 | 2 | |a International Conference on Integer Programming and Combinatorial Optimization |n (10th |d :2004 |c :New York, N.Y.). | |
| 245 | 1 | 0 | |a Integer programming and combinatorial optimization : |b 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004 : proceedings |c [edited by] Daniel Bienstock, George Nemhauser. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 3064 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Session 1 -- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem -- Metric Inequalities and the Network Loading Problem -- Valid Inequalities Based on Simple Mixed-Integer Sets -- Session 2 -- The Price of Anarchy when Costs Are Non-separable and Asymmetric -- Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem -- Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games -- Session 3 -- A Robust Optimization Approach to Supply Chain Management -- Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems -- Scheduling an Industrial Production Facility -- Session 4 -- Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs -- A TDI Description of Restricted 2-Matching Polytopes -- Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems -- Session 5 -- Semi-continuous Cuts for Mixed-Integer Programming -- Combinatorial Benders Cuts -- A Faster Exact Separation Algorithm for Blossom Inequalities -- Session 6 -- LP-based Approximation Algorithms for Capacitated Facility Location -- A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem -- Separable Concave Optimization Approximately Equals Piecewise Linear Optimization -- Session 7 -- Three Kinds of Integer Programming Algorithms Based on Barvinok s Rational Functions -- The Path-Packing Structure of Graphs -- More on a Binary-Encoded Coloring Formulation -- Session 8 -- Single Machine Scheduling with Precedence Constraints -- The Constrained Minimum Weighted Sum of Job Completion Times Problem -- Session 9 -- Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption -- A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts.-All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables -- Session 10 -- A Capacity Scaling Algorithm for M-convex Submodular Flow -- Integer Concave Cocirculations and Honeycombs -- Minsquare Factors and Maxfix Covers of Graphs -- Session 11 -- Low-Dimensional Faces of Random 0/1-Polytopes -- On Polyhedra Related to Even Factors -- Optimizing over Semimetric Polytopes. | |
| 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 Optimisation mathématique | ||
| 650 | |a Analyse numérique | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Programmation en nombres entiers | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Bienstock, Daniel. |4 pbd | |
| 700 | 1 | |a Nemhauser, George L., |d 1937- |4 pbd | |
| 776 | 0 | |0 079261698 |t Integer programming and combinatorial optimization |o 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004 |o proceedings |f Daniel Bienstock, George Nemhauser (eds.) |c Berlin |n Springer |d 2004 |p 1 vol. (XI-443 p.) |s Lecture notes in computer science |z 3-540-22113-1 | |
| 776 | 0 | |t Integer Programming and Combinatorial Optimization |b Texte imprimé |z 9783662198117 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/b97946 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-0Z4G5QVC-R |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750677988 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/b97946 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754025977 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/b97946 |z Accès INSA CVL | |
| 997 | |0 969092 |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/ | ||