Integer Programming and Combinatorial Optimization

23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022, Proceedings

AvKaren Aardal,Laura Sanità

Häftad, Engelska, 2022

Del 13265 i serien Lecture Notes in Computer Science

938 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

740 kr

571 kr

883 kr

1 430 kr

817 kr

554 kr

554 kr

572 kr

1 135 kr

554 kr

Beskrivning

This book constitutes the refereed proceedings of the 23rd International Conference on Integer Programming and Combinatorial Optimization, IPCO 2022, held in Eindhoven, The Netherlands, in June 2022. The 33 full papers presented were carefully reviewed and selected from 93 submissions addressing key techniques of document analysis. IPCO is under the auspices of the Mathematical Optimization Society, and it is an important forum for presenting the latest results of theory and practice of the various aspects of discrete optimization.

Produktinformation

Utgivningsdatum:2022-05-28
Mått:155 x 235 x 27 mm
Vikt:716 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:456
Förlag:Springer International Publishing AG
ISBN:9783031069000

Utforska kategorier

Innehållsförteckning

Total dual dyadicness and dyadic generating sets.- Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing.- On the maximal number of columns of a ∆ -modular matrix.- A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem.- aster Connectivity in Low-rank Hypergraphs via Expander Decomposition.- Improving the Cook et al. Proximity Bound Given Integral Valued Constraints.- Sparse Multi-Term Disjunctive Cuts for the Epigraph of a Function of Binary Variables.- A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time.- Optimal item pricing in online combinatorial auctions.- On Circuit Diameter Bounds via Circuit Imbalances.- A Simple Method for Convex Optimization in the Oracle Model.- On the Complexity of Separation From the Knapsack Polytope.- Simple odd β -cycle inequalities for binary polynomial optimization.- Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems.- Intersecting and dense restrictions of clutters in polynomial time.- LP-based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization.- Generalized Malleable Scheduling under Concave Processing Speeds.- Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands.- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs.- Non-Adaptive Stochastic Score Classification and Explainable Halfspace Evaluation.- On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs.- Matroid-Based TSP Rounding for Half-Integral Solutions.- The Two-Stripe Symmetric Circulant TSP is in P.- Jin and David Williamson An Abstract Model for Branch-and-Cut.- Neural networks with linear threshold activations: structure and algorithms.- A PTAS for the Horizontal Rectangle Stabbing Problem.- Lattice-free simplices with lattice width 2d - o(d) .- Graph Coloring and Semidefinite Rank.- .A Competitive Algorithm for Throughput Maximization on Identical Machines.- The Limits of Local Search for Weighted k-Set Packing.- The Secretary Problem with Distributions.

Mer från samma författare

Integer Programming and Combinatorial Optimization

Laura Sanita, Karen Aardal

E-bok

2022

1 188 kr

Integer Programming and Combinatorial Optimization

Karen Aardal, Bert Gerards

Häftad, 2001

554 kr

Integer Programming and Combinatorial Optimization

Bert Gerards, Karen Aardal

E-bok

2003

710 kr

Integer Programming and Combinatorial Optimization : 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001. Proceedings

Karen Aardal, Bert Gerards

652 kr

Mer från samma serie

Multiobjective Optimization

Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński

Häftad, 2008

554 kr

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang - Knowledge Graphs, Häftad

Del 16297

Knowledge Graphs

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang

Häftad, 2026

932 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

571 kr

Extended Reality

Lucio Tommaso De Paolis, Pasquale Arpaia, Marco Sacco

Häftad, 2026

1 164 kr

Reliable Software Technologies - Ada-Europe '98

Lars Asplund

Häftad, 1998

571 kr

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson - Advanced Parallel Processing Technologies, Häftad

Nyhet

Del 16693

Advanced Parallel Processing Technologies

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson

Häftad, 2026

1 022 kr

Del 16832

Progress in Cryptology - AFRICACRYPT 2026

Nadia El Mrabet, Loubna Ghammam, Francisco Rodríguez-Henríquez

Häftad, 2026

932 kr

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek - Electronic Participation, Häftad

Nyhet

Electronic Participation

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek

Häftad, 2026

730 kr

Del 12051

Sustainable Digital Communities

Anneli Sundqvist, Gerd Berget, Jan Nolin, Kjell Ivar Skjerdingstad

Häftad, 2020

1 071 kr

Types for Proofs and Programs

Thierry Coquand, Peter Dybjer, Bengt Nordström, Jan Smith

Häftad, 2000

571 kr

Du kanske också är intresserad av

Pokémon Pokémon Mega Evolution 05 - Pitch Black Booster

Pokémon

79 kr

Integer Programming and Combinatorial Optimization

Laura Sanita, Karen Aardal

E-bok

2022

1 188 kr

Del 12125

Integer Programming and Combinatorial Optimization

Daniel Bienstock, Giacomo Zambelli

Häftad, 2020

740 kr

Integer Programming and Combinatorial Optimization

Friedrich Eisenbrand, Bruce Shepherd

Häftad, 2010

554 kr

Integer Programming and Combinatorial Optimization

Andrea Lodi, Alessandro Panconesi, Giovanni Rinaldi

Häftad, 2008

554 kr

Integer Programming and Combinatorial Optimization

Matteo Fischetti, David P. Williamson

Häftad, 2007

554 kr

Integer Programming and Combinatorial Optimization

Michael Jünger, Volker Kaibel

Häftad, 2005

1 135 kr

Del 16588

Integer Programming and Combinatorial Optimization

Santanu S. Dey, Marco Di Summa, Domenico Salvagnin

Häftad, 2026

817 kr

Integer Programming and Combinatorial Optimization

Egon Balas, Jens Clausen

Häftad, 1995

554 kr

Integer Programming and Combinatorial Optimization

William H. Cunningham, S. Thomas McCormick, Maurice Queyranne

Häftad, 1996

554 kr

Integer Programming and Combinatorial Optimization

23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022, Proceedings

AvKaren Aardal,Laura Sanità

Häftad, Engelska, 2022

Del 13265 i serien Lecture Notes in Computer Science

938 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

740 kr

571 kr

883 kr

1 430 kr

817 kr

554 kr

554 kr

572 kr

1 135 kr

554 kr

Beskrivning

Produktinformation

Utgivningsdatum:2022-05-28
Mått:155 x 235 x 27 mm
Vikt:716 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:456
Förlag:Springer International Publishing AG
ISBN:9783031069000

Utforska kategorier

Innehållsförteckning

Total dual dyadicness and dyadic generating sets.- Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing.- On the maximal number of columns of a ∆ -modular matrix.- A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem.- aster Connectivity in Low-rank Hypergraphs via Expander Decomposition.- Improving the Cook et al. Proximity Bound Given Integral Valued Constraints.- Sparse Multi-Term Disjunctive Cuts for the Epigraph of a Function of Binary Variables.- A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time.- Optimal item pricing in online combinatorial auctions.- On Circuit Diameter Bounds via Circuit Imbalances.- A Simple Method for Convex Optimization in the Oracle Model.- On the Complexity of Separation From the Knapsack Polytope.- Simple odd β -cycle inequalities for binary polynomial optimization.- Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems.- Intersecting and dense restrictions of clutters in polynomial time.- LP-based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization.- Generalized Malleable Scheduling under Concave Processing Speeds.- Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands.- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs.- Non-Adaptive Stochastic Score Classification and Explainable Halfspace Evaluation.- On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs.- Matroid-Based TSP Rounding for Half-Integral Solutions.- The Two-Stripe Symmetric Circulant TSP is in P.- Jin and David Williamson An Abstract Model for Branch-and-Cut.- Neural networks with linear threshold activations: structure and algorithms.- A PTAS for the Horizontal Rectangle Stabbing Problem.- Lattice-free simplices with lattice width 2d - o(d) .- Graph Coloring and Semidefinite Rank.- .A Competitive Algorithm for Throughput Maximization on Identical Machines.- The Limits of Local Search for Weighted k-Set Packing.- The Secretary Problem with Distributions.

Mer från samma författare

Integer Programming and Combinatorial Optimization

Laura Sanita, Karen Aardal

E-bok

2022

1 188 kr

Integer Programming and Combinatorial Optimization

Karen Aardal, Bert Gerards

Häftad, 2001

554 kr

Integer Programming and Combinatorial Optimization

Bert Gerards, Karen Aardal

E-bok

2003

710 kr

Integer Programming and Combinatorial Optimization : 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001. Proceedings

Karen Aardal, Bert Gerards

652 kr

Mer från samma serie

Multiobjective Optimization

Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński

Häftad, 2008

554 kr

Del 16297

Knowledge Graphs

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang

Häftad, 2026

932 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

571 kr

Extended Reality

Lucio Tommaso De Paolis, Pasquale Arpaia, Marco Sacco

Häftad, 2026

1 164 kr

Reliable Software Technologies - Ada-Europe '98

Lars Asplund

Häftad, 1998

571 kr

Nyhet

Del 16693

Advanced Parallel Processing Technologies

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson

Häftad, 2026

1 022 kr

Del 16832

Progress in Cryptology - AFRICACRYPT 2026

Nadia El Mrabet, Loubna Ghammam, Francisco Rodríguez-Henríquez

Häftad, 2026

932 kr

Nyhet

Electronic Participation

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek

Häftad, 2026

730 kr

Del 12051