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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319075563, 9783319075570

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts

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

10.1007/978-3-319-07557-0_3 ◽

2014 ◽

pp. 25-36 ◽

Cited By ~ 2

Author(s):

Hassene Aissi ◽

A. Ridha Mahjoub ◽

S. Thomas McCormick ◽

Maurice Queyranne

Keyword(s):

Polynomial Time ◽

Global Minimum ◽

Polynomial Time Algorithm ◽

Time Algorithm ◽

Minimum Cuts ◽

Strongly Polynomial Time ◽

Strongly Polynomial

Download Full-text

Reverse Split Rank

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

10.1007/978-3-319-07557-0_20 ◽

2014 ◽

pp. 234-248

Author(s):

Michele Conforti ◽

Alberto Del Pia ◽

Marco Di Summa ◽

Yuri Faenza

Keyword(s):

Split Rank

Download Full-text

Submodular Maximization Meets Streaming: Matchings, Matroids, and More

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

10.1007/978-3-319-07557-0_18 ◽

2014 ◽

pp. 210-221 ◽

Cited By ~ 7

Author(s):

Amit Chakrabarti ◽

Sagar Kale

Keyword(s):

Submodular Maximization

Download Full-text

Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators

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

10.1007/978-3-319-07557-0_17 ◽

2014 ◽

pp. 198-209 ◽

Cited By ~ 3

Author(s):

Christoph Buchheim ◽

Claudia D’Ambrosio

Keyword(s):

Polynomial Optimization ◽

Mixed Integer ◽

Integer Polynomial

Download Full-text

On Simplex Pivoting Rules and Complexity Theory

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

10.1007/978-3-319-07557-0_2 ◽

2014 ◽

pp. 13-24 ◽

Cited By ~ 5

Author(s):

Ilan Adler ◽

Christos Papadimitriou ◽

Aviad Rubinstein

Keyword(s):

Complexity Theory

Download Full-text

Improved Branch-Cut-and-Price for Capacitated Vehicle Routing

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

10.1007/978-3-319-07557-0_33 ◽

2014 ◽

pp. 393-403 ◽

Cited By ~ 16

Author(s):

Diego Pecin ◽

Artur Pessoa ◽

Marcus Poggi ◽

Eduardo Uchoa

Keyword(s):

Vehicle Routing ◽

Capacitated Vehicle ◽

Branch Cut

Download Full-text

Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf’s Theorem

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

10.1007/978-3-319-07557-0_4 ◽

2014 ◽

pp. 37-51 ◽

Cited By ~ 1

Author(s):

Iskander Aliev ◽

Jesús A. De Loera ◽

Quentin Louveaux

Keyword(s):

Number Of Solutions ◽

Weighted Version ◽

Integer Programs

Download Full-text

The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs

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

10.1007/978-3-319-07557-0_19 ◽

2014 ◽

pp. 222-233

Author(s):

Chandra Chekuri ◽

Alina Ene

Keyword(s):

Flow Problem ◽

Directed Graphs

Download Full-text

Lower Bounds on the Sizes of Integer Programs without Additional Variables

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

10.1007/978-3-319-07557-0_27 ◽

2014 ◽

pp. 321-332 ◽

Cited By ~ 2

Author(s):

Volker Kaibel ◽

Stefan Weltge

Keyword(s):

Lower Bounds ◽

Integer Programs

Download Full-text

n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem

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

10.1007/978-3-319-07557-0_9 ◽

2014 ◽

pp. 102-113 ◽

Cited By ~ 2

Author(s):

Manish Bansal ◽

Kiavash Kianfar

Keyword(s):

Lot Sizing ◽

Step Cycle ◽

Lot Sizing Problem ◽

Mixing Set ◽

Capacitated Lot Sizing

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts

Reverse Split Rank

Submodular Maximization Meets Streaming: Matchings, Matroids, and More

Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators

On Simplex Pivoting Rules and Complexity Theory

Improved Branch-Cut-and-Price for Capacitated Vehicle Routing

Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf’s Theorem

The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs

Lower Bounds on the Sizes of Integer Programs without Additional Variables

n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem

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