Some problems in discrete optimization

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1971 English Publisher:Springer Science and Business Media LLCJournal:Mathematical Programming, volume 1, pages 102-112 (issn: 0025-5610, eissn: 1436-4646,

Copyright policy )

Authors: T. C. Hu;

doi: 10.1007/bf01584076

Some problems in discrete optimization

- Summary
- Subjects
- Metrics

Abstract

The present paper concentrates on several problems of network flows and discrete optimization. Progress has been made on some of the problems while little is known about others. Some of the problems discussed are shortest paths, multi-commodity flows, traveling salesman problems, m-center problem, telepak problems and binary trees.

Related Organizations

University of Wisconsin–Oshkosh
United States
University of Wisconsin–Madison
United States

Keywords

Deterministic network models in operations research, Integer programming, Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

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).	1
	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.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average