Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 33)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783030738785, 9783030738792

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-030-73879-2_14 ◽

2021 ◽

pp. 193-207

Author(s):

Alberto Del Pia ◽

Jeff Linderoth ◽

Haoran Zhu

Keyword(s):

Multiple Knapsack ◽

Cover Inequalities

Download Full-text

New Exact Techniques Applied to a Class of Network Flow Formulations

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-030-73879-2_13 ◽

2021 ◽

pp. 178-192

Author(s):

Vinícius L. de Lima ◽

Manuel Iori ◽

Flávio K. Miyazawa

Keyword(s):

Network Flow

Download Full-text

On the Recognition of $$\{a,b,c\}$$-Modular Matrices

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-030-73879-2_17 ◽

2021 ◽

pp. 238-251

Author(s):

Christoph Glanzer ◽

Ingo Stallknecht ◽

Robert Weismantel

Download Full-text

Computational Aspects of Relaxation Complexity

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-030-73879-2_26 ◽

2021 ◽

pp. 368-382

Author(s):

Gennadiy Averkov ◽

Christopher Hojny ◽

Matthias Schymura

Keyword(s):

Computational Aspects

Download Full-text

A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-030-73879-2_8 ◽

2021 ◽

pp. 104-118

Author(s):

Lukas Graf ◽

Tobias Harks

Keyword(s):

Finite Time ◽

Dynamic Equilibrium ◽

Combinatorial Algorithm

Download Full-text

Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-030-73879-2_27 ◽

2021 ◽

pp. 383-398

Author(s):

Amitabh Basu ◽

Michele Conforti ◽

Marco Di Summa ◽

Hongyi Jiang

Keyword(s):

Branch And Bound ◽

Cutting Planes ◽

Mixed Integer ◽

Integer Optimization ◽

Mixed Integer Optimization

Download Full-text

On the Integrality Gap of Binary Integer Programs with Gaussian Data

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-030-73879-2_30 ◽

2021 ◽

pp. 427-442

Author(s):

Sander Borst ◽

Daniel Dadush ◽

Sophie Huiberts ◽

Samarth Tiwari

Keyword(s):

Integrality Gap ◽

Integer Programs ◽

Gaussian Data

Download Full-text

Semi-streaming Algorithms for Submodular Matroid Intersection

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-030-73879-2_15 ◽

2021 ◽

pp. 208-222

Author(s):

Paritosh Garg ◽

Linus Jordan ◽

Ola Svensson

Keyword(s):

Streaming Algorithms ◽

Matroid Intersection

Download Full-text

A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-030-73879-2_24 ◽

2021 ◽

pp. 340-353

Author(s):

Manuel Aprile ◽

Matthew Drescher ◽

Samuel Fiorini ◽

Tony Huynh

Keyword(s):

Approximation Algorithm ◽

Vertex Deletion

Download Full-text

Sum-of-Squares Hierarchies for Binary Polynomial Optimization

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-030-73879-2_4 ◽

2021 ◽

pp. 43-57

Author(s):

Lucas Slot ◽

Monique Laurent

Keyword(s):

Polynomial Optimization ◽

Sum Of Squares

Download Full-text

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets

New Exact Techniques Applied to a Class of Network Flow Formulations

On the Recognition of $$\{a,b,c\}$$-Modular Matrices

Computational Aspects of Relaxation Complexity

A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows

Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II

On the Integrality Gap of Binary Integer Programs with Gaussian Data

Semi-streaming Algorithms for Submodular Matroid Intersection

A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem

Sum-of-Squares Hierarchies for Binary Polynomial Optimization

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science
Latest Publications