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

9783319334608, 9783319334615

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Approximation-Friendly Discrepancy Rounding

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

10.1007/978-3-319-33461-5_31 ◽

2016 ◽

pp. 375-386 ◽

Cited By ~ 2

Author(s):

Nikhil Bansal ◽

Viswanath Nagarajan

Download Full-text

Max-Cut Under Graph Constraints

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

10.1007/978-3-319-33461-5_5 ◽

2016 ◽

pp. 50-62 ◽

Cited By ~ 1

Author(s):

Jon Lee ◽

Viswanath Nagarajan ◽

Xiangkun Shen

Keyword(s):

Graph Constraints

Download Full-text

Improved Approximation Algorithms for Hitting 3-Vertex Paths

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

10.1007/978-3-319-33461-5_20 ◽

2016 ◽

pp. 238-249 ◽

Cited By ~ 3

Author(s):

Samuel Fiorini ◽

Gwenaël Joret ◽

Oliver Schaudt

Keyword(s):

Approximation Algorithms

Download Full-text

Rescaled Coordinate Descent Methods for Linear Programming

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

10.1007/978-3-319-33461-5_3 ◽

2016 ◽

pp. 26-37 ◽

Cited By ~ 1

Author(s):

Daniel Dadush ◽

László A. Végh ◽

Giacomo Zambelli

Keyword(s):

Linear Programming ◽

Coordinate Descent ◽

Descent Methods

Download Full-text

Improved Approximations for Cubic Bipartite and Cubic TSP

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

10.1007/978-3-319-33461-5_21 ◽

2016 ◽

pp. 250-261 ◽

Cited By ~ 1

Author(s):

Anke van Zuylen

Download Full-text

Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over

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

10.1007/978-3-319-33461-5_15 ◽

2016 ◽

pp. 178-189 ◽

Cited By ~ 1

Author(s):

Erik Lambrechts ◽

Annette M. C. Ficker ◽

Dries R. Goossens ◽

Frits C. R. Spieksma

Keyword(s):

Circle Method ◽

Round Robin ◽

Round Robin Tournaments ◽

Carry Over

Download Full-text

Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems

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

10.1007/978-3-319-33461-5_4 ◽

2016 ◽

pp. 38-49 ◽

Cited By ~ 3

Author(s):

André Linhares ◽

Chaitanya Swamy

Keyword(s):

Spanning Trees

Download Full-text

Extended Formulations in Mixed-Integer Convex Programming

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

10.1007/978-3-319-33461-5_9 ◽

2016 ◽

pp. 102-113 ◽

Cited By ~ 11

Author(s):

Miles Lubin ◽

Emre Yamangil ◽

Russell Bent ◽

Juan Pablo Vielma

Keyword(s):

Convex Programming ◽

Mixed Integer ◽

Extended Formulations

Download Full-text

On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank

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

10.1007/978-3-319-33461-5_25 ◽

2016 ◽

pp. 300-311 ◽

Cited By ~ 4

Author(s):

Gérard Cornuéjols ◽

Dabeen Lee

Download Full-text

On the Quantile Cut Closure of Chance-Constrained Problems

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

10.1007/978-3-319-33461-5_33 ◽

2016 ◽

pp. 398-409

Author(s):

Weijun Xie ◽

Shabbir Ahmed

Keyword(s):

Constrained Problems

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Approximation-Friendly Discrepancy Rounding

Max-Cut Under Graph Constraints

Improved Approximation Algorithms for Hitting 3-Vertex Paths

Rescaled Coordinate Descent Methods for Linear Programming

Improved Approximations for Cubic Bipartite and Cubic TSP

Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over

Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems

Extended Formulations in Mixed-Integer Convex Programming

On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank

On the Quantile Cut Closure of Chance-Constrained Problems

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