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 Berlin Heidelberg

9783540727910, 9783540727927

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Distinct Triangle Areas in a Planar Point Set

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

10.1007/978-3-540-72792-7_10 ◽

2007 ◽

pp. 119-129 ◽

Cited By ~ 1

Author(s):

Adrian Dumitrescu ◽

Csaba D. Tóth

Keyword(s):

Planar Point ◽

Point Set ◽

Distinct Triangle

Download Full-text

A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations

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

10.1007/978-3-540-72792-7_23 ◽

2007 ◽

pp. 295-309 ◽

Cited By ~ 18

Author(s):

Franz Rendl ◽

Giovanni Rinaldi ◽

Angelika Wiegele

Keyword(s):

Branch And Bound ◽

Branch And Bound Algorithm ◽

Polyhedral Relaxations

Download Full-text

Sign-Solvable Linear Complementarity Problems

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

10.1007/978-3-540-72792-7_30 ◽

2007 ◽

pp. 397-409

Author(s):

Naonori Kakimura

Keyword(s):

Complementarity Problems ◽

Linear Complementarity Problems ◽

Linear Complementarity

Download Full-text

A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications

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

10.1007/978-3-540-72792-7_17 ◽

2007 ◽

pp. 210-224 ◽

Cited By ~ 3

Author(s):

Bo Zeng ◽

Jean-Philippe P. Richard

Download Full-text

Robust Combinatorial Optimization with Exponential Scenarios

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

10.1007/978-3-540-72792-7_33 ◽

2007 ◽

pp. 439-453 ◽

Cited By ~ 36

Author(s):

Uriel Feige ◽

Kamal Jain ◽

Mohammad Mahdian ◽

Vahab Mirrokni

Keyword(s):

Combinatorial Optimization ◽

Robust Combinatorial Optimization

Download Full-text

Orbital Branching

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

10.1007/978-3-540-72792-7_9 ◽

2007 ◽

pp. 104-118 ◽

Cited By ~ 16

Author(s):

James Ostrowski ◽

Jeff Linderoth ◽

Fabrizio Rossi ◽

Stefano Smriglio

Keyword(s):

Orbital Branching

Download Full-text

Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)

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

10.1007/978-3-540-72792-7_4 ◽

2007 ◽

pp. 43-52 ◽

Cited By ~ 1

Author(s):

David Hartvigsen ◽

Yanjun Li

Keyword(s):

Subcubic Graphs

Download Full-text

Finding a Polytope from Its Graph in Polynomial Time

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

10.1007/978-3-540-72792-7_6 ◽

2007 ◽

pp. 68-73

Author(s):

Eric J. Friedman

Keyword(s):

Polynomial Time

Download Full-text

A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization

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

10.1007/978-3-540-72792-7_19 ◽

2007 ◽

pp. 240-251 ◽

Cited By ~ 25

Author(s):

James B. Orlin

Keyword(s):

Polynomial Time ◽

Polynomial Time Algorithm ◽

Time Algorithm ◽

Submodular Function ◽

Function Minimization ◽

Strongly Polynomial Time ◽

Submodular Function Minimization ◽

Strongly Polynomial

Download Full-text

Matching Problems in Polymatroids Without Double Circuits

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

10.1007/978-3-540-72792-7_14 ◽

2007 ◽

pp. 167-181 ◽

Cited By ~ 1

Author(s):

Márton Makai ◽

Gyula Pap ◽

Jácint Szabó

Keyword(s):

Matching Problems

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Distinct Triangle Areas in a Planar Point Set

A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations

Sign-Solvable Linear Complementarity Problems

A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications

Robust Combinatorial Optimization with Exponential Scenarios

Orbital Branching

Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)

Finding a Polytope from Its Graph in Polynomial Time

A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization

Matching Problems in Polymatroids Without Double Circuits

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