Integer Programming and Combinatorial Optimization : 27th International Conference, IPCO 2026, Padua, Italy, June 17-19, 2026, Proceedings.

Format:

Book

Author/Creator:

Dey, Santanu S.

Contributor:

Dey

Series:

Lecture Notes in Computer Science Series

Lecture Notes in Computer Science Series ; v.16588

Language:

English

Physical Description:

1 online resource (1069 pages)

Edition:

1st ed.

Place of Publication:

Cham : Springer, 2026.

Summary:

This book constitutes the refereed proceedings of the 27th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2026, held in Padova, Italy, during June 17-19, 2026. The 33 full papers included in this book were carefully reviewed and selected from 113 submissions.

Contents:

Lecture Notes in Computer Science

Integer Programming and Combinatorial Optimization

Preface

Organization

Contents

On the Complexity of the Odd-Red Bipartite Perfect Matching Polytope

A PTAS for Weighted Triangle-Free 2-Matching

Stronger Hardness for Maximum Robust Flow and Randomized Network Interdiction

Approximation Schemes for Planar Graph Connectivity Problems

Degree Realization with Minimum Dominating Set

1.64-Approximation for Chromatic Correlation Clustering via Chromatic Cluster LP

O(log n)-Approximation Algorithms for Bipartiteness Ratio

Approximating Multiple-Depot Capacitated Vehicle Routing via LP Rounding

The Integrality Gap of the Traveling Salesman Problem is 43 if the LP Solution Has at Most n+6 Non-Zero Components

The Local Dyadic Conjecture

On Integer Programs That Look Like Paths

Solving 4-Block Integer Linear Programs Faster Using Affine Decompositions of the Right-Hand Sides

A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity Norm

Lattice Structure and Efficient Basis Construction for Strongly Connected Orientations

On Lattice Diameter Segments: Algorithms and Structure

On Circuit Diameter and Straight Line Complexity

Improved Approximation Algorithms for Orthogonally Constrained Problems Using Semidefinite Optimization

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing

Stochastic Load Balancing with Machine Reservations

{s,t}-Separating Principal Partition Sequence of Submodular Functions

Hedgegraph Polymatroids

Efficiently Coloring the Intersection of a General Matroid and Combinatorial Matroids

Polynomial Kernels with Reachability for Weighted d-Matroid Intersection.

A Weighted-to-Unweighted Reduction for Matroid Intersection

Arithmetic Circuits and Neural Networks for Regular Matroids

Bayesian Probing on Graphs

Complexity of Bilevel Linear Programming with a Single Upper-Level Variable

A Framework for Handling and Exploiting Symmetry in Benders Decomposition

Structure-Preserving Symmetry Presolving for Mixed-Binary Linear Problems

The Strength of Root Cuts in an Extended Abstract Branch-and-Cut Model

Linear Programming Hierarchies Collapse Under Symmetry

Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters

Author Index.

Notes:

Description based on publisher supplied metadata and other sources.

ISBN:

9783032286918

OCLC:

1597392367