State-space relaxation procedures for the computation of bounds to routing problems

Christofides, Nicos; Mingozzi, A.; Toth, P.

doi:10.1002/net.3230110207

Record: found
Abstract: not found
Article: not found

State-space relaxation procedures for the computation of bounds to routing problems

Author(s): Nicos Christofides , A. Mingozzi , P. Toth

Publication date Created: 22 1981

Publication date (Print): 22 1981

Journal: Networks

Publisher: Wiley-Blackwell

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 1

Record: found
Abstract: not found
Book Chapter: not found

Lagrangean relaxation for integer programming

A. Geoffrion (1974)

0 comments Cited 127 times – based on 0 reviews

Bookmark

All references

Author and article information

Journal

Title: Networks

Abbreviated Title: Networks

Publisher: Wiley-Blackwell

ISSN (Print): 00283045

ISSN (Electronic): 10970037

Publication date Created: 22 1981

Publication date (Print): 22 1981

Volume: 11

Issue: 2

Pages: 145-164

Article

DOI: 10.1002/net.3230110207

SO-VID: c15881f7-7432-4327-845f-6ec4ef959ff2

License:

http://doi.wiley.com/10.1002/tdm_license_1.1

History

Data availability:

State-space relaxation procedures for the computation of bounds to routing problems

Read this article at

Related collections

Cascading Disasters

Most cited references 1

Lagrangean relaxation for integer programming

Author and article information

Journal

Article

History

Comments

Comment on this article

Similar content 1,589

Cited by 33

Most referenced authors 5