Lecture Notes in Computer Science - Combinatorial Optimization
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642321467, 9783642321474

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines

Lecture Notes in Computer Science - Combinatorial Optimization ◽

10.1007/978-3-642-32147-4_35 ◽

2012 ◽

pp. 392-403 ◽

Cited By ~ 6

Author(s):

Dennis Weyland ◽

Roberto Montemanni ◽

Luca Maria Gambardella

Keyword(s):

Traveling Salesman Problem ◽

Traveling Salesman

Download Full-text

The Gram Dimension of a Graph

Lecture Notes in Computer Science - Combinatorial Optimization ◽

10.1007/978-3-642-32147-4_32 ◽

2012 ◽

pp. 356-367 ◽

Cited By ~ 5

Author(s):

Monique Laurent ◽

Antonios Varvitsiotis

Download Full-text

On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem

Lecture Notes in Computer Science - Combinatorial Optimization ◽

10.1007/978-3-642-32147-4_21 ◽

2012 ◽

pp. 225-236

Author(s):

Mario Ruthmair ◽

Günther R. Raidl

Keyword(s):

Steiner Tree ◽

Steiner Tree Problem ◽

Constrained Steiner Tree ◽

Delay Variation

Download Full-text

Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models

Lecture Notes in Computer Science - Combinatorial Optimization ◽

10.1007/978-3-642-32147-4_20 ◽

2012 ◽

pp. 213-224

Author(s):

Marie-Emilie Voge ◽

François Clautiaux

Keyword(s):

Theoretical Investigation ◽

Network Flow ◽

Flow Models ◽

Network Flow Models

Download Full-text

Fast Separation Algorithms for Three-Index Assignment Problems

Lecture Notes in Computer Science - Combinatorial Optimization ◽

10.1007/978-3-642-32147-4_18 ◽

2012 ◽

pp. 189-200 ◽

Cited By ~ 1

Author(s):

Trivikram Dokka ◽

Ioannis Mourtos ◽

Frits C. R. Spieksma

Keyword(s):

Assignment Problems ◽

Fast Separation ◽

Index Assignment

Download Full-text

Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm

Lecture Notes in Computer Science - Combinatorial Optimization ◽

10.1007/978-3-642-32147-4_17 ◽

2012 ◽

pp. 178-188 ◽

Cited By ~ 1

Author(s):

Laura Galli ◽

Konstantinos Kaparis ◽

Adam N. Letchford

Keyword(s):

Cutting Plane ◽

Cutting Plane Algorithm ◽

Max Cut Problem

Download Full-text

Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem

Lecture Notes in Computer Science - Combinatorial Optimization ◽

10.1007/978-3-642-32147-4_12 ◽

2012 ◽

pp. 117-128

Author(s):

Mathieu Lacroix ◽

A. Ridha Mahjoub ◽

Sébastien Martin

Keyword(s):

Structural Analysis ◽

Branch And Cut ◽

Analysis Problem ◽

Polyhedral Analysis

Download Full-text

Second-Price Ad Auctions with Binary Bids and Markets with Good Competition

Lecture Notes in Computer Science - Combinatorial Optimization ◽

10.1007/978-3-642-32147-4_39 ◽

2012 ◽

pp. 439-450

Author(s):

Cristina G. Fernandes ◽

Rafael C. S. Schouery

Keyword(s):

Ad Auctions

Download Full-text

Two-Agent Scheduling on an Unbounded Serial Batching Machine

Lecture Notes in Computer Science - Combinatorial Optimization ◽

10.1007/978-3-642-32147-4_38 ◽

2012 ◽

pp. 427-438 ◽

Cited By ~ 11

Author(s):

Mikhail Y. Kovalyov ◽

Ammar Oulamara ◽

Ameur Soukhal

Keyword(s):

Agent Scheduling ◽

Batching Machine

Download Full-text

Branch-and-Price Guided Search

Lecture Notes in Computer Science - Combinatorial Optimization ◽

10.1007/978-3-642-32147-4_2 ◽

2012 ◽

pp. 15-18

Author(s):

Mike Hewitt ◽

George L. Nemhauser ◽

Martin Savelsbergh

Keyword(s):

Branch And Price ◽

Guided Search

Download Full-text

Lecture Notes in Computer Science - Combinatorial OptimizationLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines

The Gram Dimension of a Graph

On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem

Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models

Fast Separation Algorithms for Three-Index Assignment Problems

Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm

Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem

Second-Price Ad Auctions with Binary Bids and Markets with Good Competition

Two-Agent Scheduling on an Unbounded Serial Batching Machine

Branch-and-Price Guided Search

Lecture Notes in Computer Science - Combinatorial Optimization
Latest Publications