Del 12125 i serien Lecture Notes in Computer Science

Integer Programming and Combinatorial Optimization

21st International Conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings

Häftad, Engelska, 2020

969 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the refereed proceedings of the 21st International Conference on Integer Programming and Combinatorial Optimization, IPCO 2020, held in London, UK, in June 2020. The 33 full versions of extended abstracts presented were carefully reviewed and selected from 126 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.

Produktinformation

Utgivningsdatum2020-04-14
Mått155 x 235 x 25 mm
Vikt692 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor450
FörlagSpringer Nature Switzerland AG
ISBN9783030457709

Tillhör följande kategorier

Idealness of k-wise intersecting families.- Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity.- Faster Algorithms for Parametric Global Minimum Cut Problems.- Optimizing Sparsity over Lattices and Semigroups.- A Technique for Obtaining True Approximations for k-Center with Covering Constraints.- Tight Approximation Bounds for Maximum Multi-Coverage.- Implementing automatic Benders decomposition in a modern MIP solver.- Improved Approximation Algorithms for Inventory Problems.- Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles.- On a generalization of the Chv atal-Gomory closure.- Algorithms for ows over time with scheduling costs.- Integer Plane Multi ow Maximisation: Flow-Cut Gap and One-Quarter-Approximation.- Stochastic Makespan Minimization in Structured Set Systems.- Continuous facility location on graphs.- Recognizing even-cycle and even-cut matroids.- A combinatorial algorithm for computing therank of a generic partitioned matrix with $2 ntimes 2$ submatrices.- Fair Colorful k-Center Clustering.- Popular Branchings and Their Dual Certi cates.- Sparse graphs and an augmentation problem.- About the Complexity of Two-Stage Stochastic Ips.- Packing under Convex Quadratic Constraints.- Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles.- Single source unsplittable ows with arc-wise lower and upper bounds.- Maximal quadratic-free sets.- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming.- Andrea Lodi and Felipe Serrano.- The integrality number of an integer program.- Persistency of Linear Programming Relaxations for the Stable Set Problem.- Constructing lattice-free gradient polyhedra in dimension two.- Sequence independent lifting for the set of submodular maximization problem.- A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering.- Graph Coloring Lower Bounds from Decision Diagrams.- On convex hulls of epigraphs of QCQPs.- On the convexi cation of constrained quadratic optimization problems with indicator variables.

Du kanske också är intresserad av

Del 271

Integer Programming

Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli

Häftad, 2016

799 kr

Del 271

Integer Programming

Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli

Inbunden, 2014

799 kr

Del 53

Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice

Daniel Bienstock

Häftad, 2013

1 439 kr

Integer Programming and Combinatorial Optimization

George Nemhauser, Daniel Bienstock

Häftad, 2004

719 kr

Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice

Daniel Bienstock

Inbunden, 2002

1 439 kr

Ruth Kvarnström-Jones - Systrarna på Sophiahemmet, Inbunden

Nyhet

Del 3

Systrarna på Sophiahemmet

Ruth Kvarnström-Jones

Inbunden, 2026

299 kr329 kr

Nyhet

Del 11

Medusa

Lars Kepler

Inbunden, 2026

289 kr319 kr

Nyhet

Del 4

Sot

Sara Strömberg

Pocket, 2026

79 kr129 kr

Del 3

Skinn

Sara Strömberg

Pocket, 2024

79 kr129 kr

Del 1

Sly

Sara Strömberg

Pocket, 2022

79 kr129 kr

Del 12125 i serien Lecture Notes in Computer Science

Integer Programming and Combinatorial Optimization

21st International Conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings

Häftad, Engelska, 2020

AvDaniel Bienstock,Giacomo Zambelli

969 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum2020-04-14
Mått155 x 235 x 25 mm
Vikt692 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor450
FörlagSpringer Nature Switzerland AG
ISBN9783030457709

Tillhör följande kategorier

Idealness of k-wise intersecting families.- Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity.- Faster Algorithms for Parametric Global Minimum Cut Problems.- Optimizing Sparsity over Lattices and Semigroups.- A Technique for Obtaining True Approximations for k-Center with Covering Constraints.- Tight Approximation Bounds for Maximum Multi-Coverage.- Implementing automatic Benders decomposition in a modern MIP solver.- Improved Approximation Algorithms for Inventory Problems.- Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles.- On a generalization of the Chv atal-Gomory closure.- Algorithms for ows over time with scheduling costs.- Integer Plane Multi ow Maximisation: Flow-Cut Gap and One-Quarter-Approximation.- Stochastic Makespan Minimization in Structured Set Systems.- Continuous facility location on graphs.- Recognizing even-cycle and even-cut matroids.- A combinatorial algorithm for computing therank of a generic partitioned matrix with $2 ntimes 2$ submatrices.- Fair Colorful k-Center Clustering.- Popular Branchings and Their Dual Certi cates.- Sparse graphs and an augmentation problem.- About the Complexity of Two-Stage Stochastic Ips.- Packing under Convex Quadratic Constraints.- Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles.- Single source unsplittable ows with arc-wise lower and upper bounds.- Maximal quadratic-free sets.- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming.- Andrea Lodi and Felipe Serrano.- The integrality number of an integer program.- Persistency of Linear Programming Relaxations for the Stable Set Problem.- Constructing lattice-free gradient polyhedra in dimension two.- Sequence independent lifting for the set of submodular maximization problem.- A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering.- Graph Coloring Lower Bounds from Decision Diagrams.- On convex hulls of epigraphs of QCQPs.- On the convexi cation of constrained quadratic optimization problems with indicator variables.

Du kanske också är intresserad av

Del 271

Integer Programming

Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli

Häftad, 2016

799 kr

Del 271

Integer Programming

Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli

Inbunden, 2014

799 kr

Del 53

Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice

Daniel Bienstock

Häftad, 2013

1 439 kr

Integer Programming and Combinatorial Optimization

George Nemhauser, Daniel Bienstock

Häftad, 2004

719 kr

Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice

Daniel Bienstock

Inbunden, 2002

1 439 kr

Nyhet

Del 3

Systrarna på Sophiahemmet

Ruth Kvarnström-Jones

Inbunden, 2026

299 kr329 kr

Nyhet

Del 11

Medusa

Lars Kepler

Inbunden, 2026

289 kr319 kr

Nyhet

Del 4

Sot

Sara Strömberg

Pocket, 2026

79 kr129 kr

Del 3

Skinn

Sara Strömberg

Pocket, 2024

79 kr129 kr

Del 1

Sly

Sara Strömberg

Pocket, 2022

79 kr129 kr

Integer Programming and Combinatorial Optimization

21st International Conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings

Produktinformation

Tillhör följande kategorier

Innehållsförteckning

Du kanske också är intresserad av

Integer Programming and Combinatorial Optimization

21st International Conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings

Produktinformation

Tillhör följande kategorier

Innehållsförteckning

Du kanske också är intresserad av

Integer Programming and Combinatorial Optimization

21st International Conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings

Produktinformation

Tillhör följande kategorier

Innehållsförteckning

Du kanske också är intresserad av