Mathematical Programming Studies - Netflow at Pisa
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642009228, 9783642009235

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Common aspects of several network flow algorithms

Mathematical Programming Studies - Netflow at Pisa ◽

10.1007/bfb0121095 ◽

1986 ◽

pp. 205-208

Author(s):

Johannes Siedersleben

Keyword(s):

Network Flow

Download Full-text

Finding all optimal solutions to the network flow problem

Mathematical Programming Studies - Netflow at Pisa ◽

10.1007/bfb0121096 ◽

1986 ◽

pp. 209-212 ◽

Cited By ~ 2

Author(s):

Nicos Christofides ◽

V. Valls

Keyword(s):

Network Flow ◽

Flow Problem ◽

Optimal Solutions ◽

Network Flow Problem

Download Full-text

Threshold assignment algorithm

Mathematical Programming Studies - Netflow at Pisa ◽

10.1007/bfb0121086 ◽

1986 ◽

pp. 12-37 ◽

Cited By ~ 15

Author(s):

Fred Glover ◽

Randy Glover ◽

Darwin Klingman

Keyword(s):

Assignment Algorithm

Download Full-text

Vehicle routing and scheduling with time windows

Mathematical Programming Studies - Netflow at Pisa ◽

10.1007/bfb0121107 ◽

1986 ◽

pp. 249-251 ◽

Cited By ~ 3

Author(s):

J. Desrosiers ◽

F. Soumis ◽

M. Desrochers ◽

M. Sauvé

Keyword(s):

Vehicle Routing ◽

Time Windows ◽

Vehicle Routing And Scheduling ◽

Routing And Scheduling

Download Full-text

Nonlinear cost network models in transportation analysis

Mathematical Programming Studies - Netflow at Pisa ◽

10.1007/bfb0121092 ◽

1986 ◽

pp. 167-196 ◽

Cited By ~ 66

Author(s):

Michael Florian

Keyword(s):

Network Models

Download Full-text

An efficient implementation of the network simplex method

Mathematical Programming Studies - Netflow at Pisa ◽

10.1007/bfb0121089 ◽

1986 ◽

pp. 83-111 ◽

Cited By ~ 59

Author(s):

M. D. Grigoriadis

Keyword(s):

Simplex Method ◽

Efficient Implementation ◽

Network Simplex

Download Full-text

Shortest path methods: A unifying approach

Mathematical Programming Studies - Netflow at Pisa ◽

10.1007/bfb0121087 ◽

1986 ◽

pp. 38-64 ◽

Cited By ~ 90

Author(s):

Giorgio Gallo ◽

Stefano Pallottino

Keyword(s):

Shortest Path

Download Full-text

Some experience in applying a stochastic method to location problems

Mathematical Programming Studies - Netflow at Pisa ◽

10.1007/bfb0121102 ◽

1986 ◽

pp. 229-232 ◽

Cited By ~ 5

Author(s):

P. M. Camerini ◽

A. Colorni ◽

F. Maffioli

Keyword(s):

Stochastic Method ◽

Location Problems

Download Full-text

Tailoring Benders decomposition for uncapacitated network design

Mathematical Programming Studies - Netflow at Pisa ◽

10.1007/bfb0121090 ◽

1986 ◽

pp. 112-154 ◽

Cited By ~ 73

Author(s):

T. L. Magnanti ◽

P. Mireault ◽

R. T. Wong

Keyword(s):

Network Design ◽

Benders Decomposition

Download Full-text

Advanced start for the multicommodity network flow problem

Mathematical Programming Studies - Netflow at Pisa ◽

10.1007/bfb0121100 ◽

1986 ◽

pp. 221-224 ◽

Cited By ~ 6

Author(s):

G. Saviozzi

Keyword(s):

Network Flow ◽

Flow Problem ◽

Network Flow Problem ◽

Multicommodity Network Flow

Download Full-text

Mathematical Programming Studies - Netflow at PisaLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Common aspects of several network flow algorithms

Finding all optimal solutions to the network flow problem

Threshold assignment algorithm

Vehicle routing and scheduling with time windows

Nonlinear cost network models in transportation analysis

An efficient implementation of the network simplex method

Shortest path methods: A unifying approach

Some experience in applying a stochastic method to location problems

Tailoring Benders decomposition for uncapacitated network design

Advanced start for the multicommodity network flow problem

Mathematical Programming Studies - Netflow at Pisa
Latest Publications