skip to main content
10.1145/1499586.1499703acmotherconferencesArticle/Chapter ViewAbstractPublication PagesafipsConference Proceedingsconference-collections
research-article

Min-max relations and combinatorial algorithms

Published: 04 June 1973 Publication History

Abstract

Min-max relations are an important tool in the development of combinatorial algorithms, for they provide a means of determining when an optimal solution has been obtained and a means of demonstrating the optimality of the solution. Many combinatorial problems can be expressed as integer programming problems. When a set of linear inequalities sufficient to define the convex hull of the feasible solutions is known, linear programming duality immediately yields a min-max theorem.
We discuss these ideas with respect to the weighted matching problem and describe several min-max theorems which can be obtained in this fashion.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
AFIPS '73: Proceedings of the June 4-8, 1973, national computer conference and exposition
June 1973
936 pages
ISBN:9781450379168
DOI:10.1145/1499586
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

  • AFIPS: American Federation of Information Processing Societies

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 June 1973

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 0
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media