Validation of subgradient optimization

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1974 English Publisher:Springer Science and Business Media LLCJournal:Mathematical Programming, volume 6, pages 62-88 (issn: 0025-5610, eissn: 1436-4646,

Copyright policy )

Authors: Michael Held; Philip Wolfe; Harlan P. Crowder;

doi: 10.1007/bf01580223

Validation of subgradient optimization

- Summary
- Subjects
- Metrics

Abstract

The "relaxation" procedure introduced by Held and Karp for approximately solving a large linear programming problem related to the traveling-salesman problem is refined and studied experimentally on several classes of specially structured large-scale linear programming problems, and results on the use of the procedure for obtaining exact solutions are given. It is concluded that the method shows promise for large-scale linear programming

Related Organizations

Polish Academy of Sciences
Poland
Systems Research Institute
Poland
IBM Research – Thomas J. Watson Research Center
United States
IBM (United States)
United States

Keywords

Linear programming, Integer programming

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	980
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 0.1%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 0.01%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%