Mathematical Programming Studies - Combinatorial Optimization
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642008016, 9783642008023

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Polynomial bounding for NP-hard problems

Mathematical Programming Studies - Combinatorial Optimization ◽

10.1007/bfb0120890 ◽

1980 ◽

pp. 115-119

Author(s):

P. M. Camerini ◽

F. Maffioli

Keyword(s):

Np Hard ◽

Hard Problems ◽

Np Hard Problems

Download Full-text

A technique for determining blocking and anti-blocking polyhedral descriptions

Mathematical Programming Studies - Combinatorial Optimization ◽

10.1007/bfb0120896 ◽

1980 ◽

pp. 197-205 ◽

Cited By ~ 1

Author(s):

H.-C. Huang ◽

L. E. Trotter

Download Full-text

On the symmetric travelling salesman problem: Solution of a 120-city problem

Mathematical Programming Studies - Combinatorial Optimization ◽

10.1007/bfb0120887 ◽

1980 ◽

pp. 61-77 ◽

Cited By ~ 62

Author(s):

Martin Grötschel

Keyword(s):

Travelling Salesman Problem ◽

Problem Solution ◽

Travelling Salesman

Download Full-text

On the symmetric travelling salesman problem: A computational study

Mathematical Programming Studies - Combinatorial Optimization ◽

10.1007/bfb0120888 ◽

1980 ◽

pp. 78-107 ◽

Cited By ~ 83

Author(s):

Manfred W. Padberg ◽

Saman Hong

Keyword(s):

Computational Study ◽

Travelling Salesman Problem ◽

Travelling Salesman

Download Full-text

Certain kinds of polar sets and their relation to mathematical programming

Mathematical Programming Studies - Combinatorial Optimization ◽

10.1007/bfb0120897 ◽

1980 ◽

pp. 206-213 ◽

Cited By ~ 3

Author(s):

Jørgen Tind

Keyword(s):

Mathematical Programming

Download Full-text

Fractional vertices, cuts and facets of the simple plant location problem

Mathematical Programming Studies - Combinatorial Optimization ◽

10.1007/bfb0120893 ◽

1980 ◽

pp. 150-162 ◽

Cited By ~ 29

Author(s):

Monique Guignard

Keyword(s):

Location Problem ◽

Plant Location

Download Full-text

Dual integrality in b-matching problems

Mathematical Programming Studies - Combinatorial Optimization ◽

10.1007/bfb0120895 ◽

1980 ◽

pp. 176-196 ◽

Cited By ~ 29

Author(s):

W. Pulleyblank

Keyword(s):

Matching Problems

Download Full-text

Quadratic knapsack problems

Mathematical Programming Studies - Combinatorial Optimization ◽

10.1007/bfb0120892 ◽

1980 ◽

pp. 132-149 ◽

Cited By ~ 121

Author(s):

G. Gallo ◽

P. L. Hammer ◽

B. Simeone

Keyword(s):

Knapsack Problems ◽

Quadratic Knapsack

Download Full-text

A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation

Mathematical Programming Studies - Combinatorial Optimization ◽

10.1007/bfb0120889 ◽

1980 ◽

pp. 108-114 ◽

Cited By ~ 3

Author(s):

T. H. C. Smith

Keyword(s):

Travelling Salesman Problem ◽

Travelling Salesman ◽

Enumeration Algorithm ◽

Implicit Enumeration ◽

Asymmetric Travelling Salesman Problem

Download Full-text

Weakly admissible transformations for solving algebraic assignment and transportation problems

Mathematical Programming Studies - Combinatorial Optimization ◽

10.1007/bfb0120884 ◽

1980 ◽

pp. 1-18 ◽

Cited By ~ 21

Author(s):

R. E. Burkard ◽

U. Zimmermann

Keyword(s):

Transportation Problems

Download Full-text

Mathematical Programming Studies - Combinatorial OptimizationLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Polynomial bounding for NP-hard problems

A technique for determining blocking and anti-blocking polyhedral descriptions

On the symmetric travelling salesman problem: Solution of a 120-city problem

On the symmetric travelling salesman problem: A computational study

Certain kinds of polar sets and their relation to mathematical programming

Fractional vertices, cuts and facets of the simple plant location problem

Dual integrality in b-matching problems

Quadratic knapsack problems

A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation

Weakly admissible transformations for solving algebraic assignment and transportation problems

Mathematical Programming Studies - Combinatorial Optimization
Latest Publications