|
|
|
|
LEADER |
04405nam a22006135i 4500 |
001 |
978-3-540-25960-2 |
003 |
DE-He213 |
005 |
20151204143923.0 |
007 |
cr nn 008mamaa |
008 |
121227s2004 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540259602
|9 978-3-540-25960-2
|
024 |
7 |
|
|a 10.1007/b97946
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA273.A1-274.9
|
050 |
|
4 |
|a QA274-274.9
|
072 |
|
7 |
|a PBT
|2 bicssc
|
072 |
|
7 |
|a PBWL
|2 bicssc
|
072 |
|
7 |
|a MAT029000
|2 bisacsh
|
082 |
0 |
4 |
|a 519.2
|2 23
|
245 |
1 |
0 |
|a Integer Programming and Combinatorial Optimization
|h [electronic resource] :
|b 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004. Proceedings /
|c edited by Daniel Bienstock, George Nemhauser.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2004.
|
300 |
|
|
|a XII, 448 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3064
|
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.
|
650 |
|
0 |
|a Mathematics.
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Numerical analysis.
|
650 |
|
0 |
|a Computer science
|x Mathematics.
|
650 |
|
0 |
|a Applied mathematics.
|
650 |
|
0 |
|a Engineering mathematics.
|
650 |
|
0 |
|a Probabilities.
|
650 |
1 |
4 |
|a Mathematics.
|
650 |
2 |
4 |
|a Probability Theory and Stochastic Processes.
|
650 |
2 |
4 |
|a Applications of Mathematics.
|
650 |
2 |
4 |
|a Theory of Computation.
|
650 |
2 |
4 |
|a Numeric Computing.
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
700 |
1 |
|
|a Bienstock, Daniel.
|e editor.
|
700 |
1 |
|
|a Nemhauser, George.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540221135
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3064
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/b97946
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|