feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    b3kat_BV036515638
    Format: XIII, 466 S. , graph. Darst. , 24 cm
    ISBN: 9783642130359
    Series Statement: Lecture notes in computer science 6080
    Note: Literaturangaben
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Ganzzahlige Optimierung ; Kombinatorische Optimierung ; Konferenzschrift ; Kongress
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    b3kat_BV036557866
    Format: 1 Online-Ressource (XIII, 466 S.) , graph. Darst.
    ISBN: 9783642130359 , 9783642130366
    Series Statement: Lecture notes in computer science 6080
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Ganzzahlige Optimierung ; Kombinatorische Optimierung ; Konferenzschrift ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    kobvindex_ZLB12755194
    Format: 4 Blatt
    Edition: 1
    Note: Text engl.
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    b3kat_BV044346412
    Format: XI, 456 Seiten , Diagramme
    ISBN: 9783319592497
    Series Statement: Lecture notes in computer science 10328
    Additional Edition: Erscheint auch als Online-Ausgabe ISBN 978-3-319-59250-3
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Ganzzahlige Optimierung ; Kombinatorische Optimierung ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    UID:
    kobvindex_ZIB000014616
    Format: XIII, 466 S. : , graph. Darst.
    ISBN: 3-642-13035-6 , 978-3-642-13035-9
    Series Statement: Lecture notes in computer science 6080
    Note: Literaturangaben
    Language: English
    URL: 01  (lizenzfrei)
    URL: 04
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    almahu_9947364132702882
    Format: XIII, 466 p. 45 illus. , online resource.
    ISBN: 9783642130366
    Series Statement: Lecture Notes in Computer Science, 6080
    Content: Theidea ofa refereedconferencefor the mathematicalprogrammingcommunity was proposed by Ravi Kannan and William Pulleyblank to the Mathematical Programming Society (MPS) in the late 1980s. Thus IPCO was born, and MPS has sponsored the conference as one of its main events since IPCO I at the University of Waterloo in 1990. The conference has become the main forum for recent results in Integer Programming and Combinatorial Optimization in the non-Symposium years. This volume compiles the papers presented at IPCO XIV held June 9-11, 2010, at EPFL in Lausanne. The scope of papers considered for IPCO XIV is likely broader than at IPCO I. This is sometimes due to the wealth of new questions and directions brought from related areas. It can also be due to the successful application of “math programming” techniques to models not tra- tionally considered. In any case, the interest in IPCO is greater than ever and this is re?ected in both the number (135) and quality of the submissions. The ProgrammeCommittee with 13 memberswasalsoIPCO’slargest. We thankthe members of the committee, as well as their sub-reviewers, for their exceptional (and time-consuming) work and especially during the online committee meeting held over January. The process resulted in the selection of 34 excellent research papers which were presented in non-parallel sessions over three days in L- sanne. Unavoidably, this has meant that many excellent submissions were not able to be included.
    Note: Solving LP Relaxations of Large-Scale Precedence Constrained Problems -- Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings -- Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems -- Restricted b-Matchings in Degree-Bounded Graphs -- Zero-Coefficient Cuts -- Prize-Collecting Steiner Network Problems -- On Lifting Integer Variables in Minimal Inequalities -- Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities -- On Generalizations of Network Design Problems with Degree Bounds -- A Polyhedral Study of the Mixed Integer Cut -- Symmetry Matters for the Sizes of Extended Formulations -- A 3-Approximation for Facility Location with Uniform Capacities -- Secretary Problems via Linear Programming -- Branched Polyhedral Systems -- Hitting Diamonds and Growing Cacti -- Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems -- A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs -- Universal Sequencing on a Single Machine -- Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm -- Integer Quadratic Quasi-polyhedra -- An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs -- An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming -- Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain -- The Price of Collusion in Series-Parallel Networks -- The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron -- A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information -- On Column-Restricted and Priority Covering Integer Programs -- On k-Column Sparse Packing Programs -- Hypergraphic LP Relaxations for Steiner Trees -- Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs -- Efficient Algorithms for Average Completion Time Scheduling -- Experiments with Two Row Tableau Cuts -- An OPT?+?1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths -- On the Rank of Cutting-Plane Proof Systems.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783642130359
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    UID:
    b3kat_BV024445564
    Format: 4 Seiten
    Edition: Als Manuskript vervielfältigt
    Series Statement: Preprint-Reihe Mathematik 605
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    UID:
    almahu_9947388501402882
    Format: XI, 456 p. 34 illus. , online resource.
    ISBN: 9783319592503
    Series Statement: Lecture Notes in Computer Science, 10328
    Content: This book constitutes the refereed proceedings of the 19th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2017, held in Waterloo, IN, Canada, in June 2017. The 36 full papers presented were carefully reviewed and selected from 125 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.
    Note: The Two-point Fano and Ideal Binary Clutters -- On Scheduling Coflows -- Integrality Gaps of Integer Knapsack Problems -- An Improved Integrality Gap for the Calinescu-Karloff-Rabani Relaxation for Multiway Cut -- Approximation of Corner Polyhedra with Families of Intersection Cuts -- The Structure of the Infinite Models in Integer Programming -- Mixed-integer Linear Representability, Disjunctions, and Variable Elimination -- Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time -- Cutting Planes from Wide Split Disjunctions -- The Salesman's Improved Tours for Fundamental Classes -- The Heterogeneous Capacitated k-Center Problem -- Local Guarantees in Graph Cuts and Clustering -- Verifying Integer Programming Results -- Long term Behavior of Dynamic Equilibria in uid Queuing Networks -- A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem -- Minimizing Multimodular Functions and Allocating Capacity in Bike-sharing Systems -- Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing -- Discrete Newton's Algorithm for Parametric Submodular Function Minimization -- Stochastic Online Scheduling on Unrelated Machines -- Online Matroid Intersection: Beating Half for Random Arrival -- Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector -- An Improved Deterministic Rescaling for Linear Programming Algorithms -- Min-Max Theorems for Packing and Covering Odd (u; v)-trails -- Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization -- A Quasi-Polynomial Approximation for the Restricted Assignment Problem -- Adaptive Submodular Ranking -- On the Notions of Facets, Weak Facets, and Extreme Functions of the Gomory-Johnson Infinite Group Problem -- Minimum Birkhoff-von Neumann Decomposition -- Maximum Matching in the Online Batch-Arrival Model -- Budget Feasible Mechanisms on Matroids -- Deterministic Discrepancy Minimization Via the Multiplicative Weight Update Method -- Mixed-integer Convex Representability -- High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and Chvatal-Gomory Cuts -- Enumeration of Integer Points in Projections of Unbounded Polyhedral -- Excluded t-factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-matchings -- Equilibrium Computation in Atomic Splittable Singleton Congestion Games. .
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783319592497
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    UID:
    edocfu_BV044397007
    Format: 1 Online-Ressource (XI, 456 Seiten) : , Illustrationen.
    ISBN: 978-3-319-59250-3
    Series Statement: Lecture Notes in Computer Science 10328
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-319-59249-7
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Ganzzahlige Optimierung ; Kombinatorische Optimierung ; Konferenzschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    UID:
    gbv_1659346045
    Format: Online-Ressource (XI, 456 p. 34 illus, online resource)
    ISBN: 9783319592503
    Series Statement: Lecture Notes in Computer Science 10328
    Content: This book constitutes the refereed proceedings of the 19th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2017, held in Waterloo, IN, Canada, in June 2017. The 36 full papers presented were carefully reviewed and selected from 125 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems
    Content: The Two-point Fano and Ideal Binary Clutters -- On Scheduling Coflows -- Integrality Gaps of Integer Knapsack Problems -- An Improved Integrality Gap for the Calinescu-Karloff-Rabani Relaxation for Multiway Cut -- Approximation of Corner Polyhedra with Families of Intersection Cuts -- The Structure of the Infinite Models in Integer Programming -- Mixed-integer Linear Representability, Disjunctions, and Variable Elimination -- Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time -- Cutting Planes from Wide Split Disjunctions -- The Salesman's Improved Tours for Fundamental Classes -- The Heterogeneous Capacitated k-Center Problem -- Local Guarantees in Graph Cuts and Clustering -- Verifying Integer Programming Results -- Long term Behavior of Dynamic Equilibria in uid Queuing Networks -- A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem -- Minimizing Multimodular Functions and Allocating Capacity in Bike-sharing Systems -- Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing -- Discrete Newton's Algorithm for Parametric Submodular Function Minimization -- Stochastic Online Scheduling on Unrelated Machines -- Online Matroid Intersection: Beating Half for Random Arrival -- Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector -- An Improved Deterministic Rescaling for Linear Programming Algorithms -- Min-Max Theorems for Packing and Covering Odd (u; v)-trails -- Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization -- A Quasi-Polynomial Approximation for the Restricted Assignment Problem -- Adaptive Submodular Ranking -- On the Notions of Facets, Weak Facets, and Extreme Functions of the Gomory-Johnson Infinite Group Problem -- Minimum Birkhoff-von Neumann Decomposition -- Maximum Matching in the Online Batch-Arrival Model -- Budget Feasible Mechanisms on Matroids -- Deterministic Discrepancy Minimization Via the Multiplicative Weight Update Method -- Mixed-integer Convex Representability -- High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and Chvatal-Gomory Cuts -- Enumeration of Integer Points in Projections of Unbounded Polyhedral -- Excluded t-factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-matchings -- Equilibrium Computation in Atomic Splittable Singleton Congestion Games
    Additional Edition: ISBN 9783319592497
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-319-59249-7
    Additional Edition: Printed edition ISBN 9783319592497
    Language: English
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages