Notes—On a Selection Problem
Reads0
Chats0
TLDR
In this article, the authors proposed a combinatorial station selection problem that can be solved by identifying minimum cuts with optimal selection, and showed how to solve this problem with minimum cuts and optimal selection.Abstract:
John Rhys [Rhys, J. 1970. Shared fixed cost and network flows. Management Sci. 17(3, November).], and then J. D. Murchland [Murchland, J. D. 1968. Rhys's combinatorial station selection problem. Report LBS-TNT-68, London Graduate School of Business Studies, Transport Network Theory Unit, June 10.], have discussed a model aimed at making an optimal selection in a particular situation having several applications. This note shows how this problem can be solved by identifying minimum cuts with optimal selection.read more
Citations
More filters
Book ChapterDOI
Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
TL;DR: In this paper, it was shown that the problem is NP-complete if there are arbitrary precedence constraints, but can be solved in O( n log n ) time if precedence constraints are series parallel.
Journal ArticleDOI
The boolean quadric polytope: Some characteristics, facets and relatives
TL;DR: It is shown that the known polynomiality result for the maximization of nonnegative quadratic forms can be obtained by simply rounding the solution to the linear programming relaxation, and the Boolean quadric polytope QPn inn(n+1)/2 dimensions is considered.
Book ChapterDOI
Quadratic knapsack problems
TL;DR: The quadratic knapsack (QK) model naturally arises in a variety of problems in operations research, statistics and combinatorics as discussed by the authors, and its use in branch-and-bound schemes for solving such problems is well-known.
Journal ArticleDOI
Minimum cuts and related problems
Jean-Claude Picard,H. D. Ratliff +1 more
TL;DR: This characterization of a cut in a network provides a fundamental equivalence between directed pseudosummetric networks and undirected networks and identifies a class of problems which can be solved as minimum cut problems on a network.
Journal ArticleDOI
A Selection Problem of Shared Fixed Costs and Network Flows
TL;DR: In this article, an apparently combinatorial problem is defined, and a method given for solution by reduction to a network flow problem, where the benefits to be obtained cannot be related to individual cost-incurring items (facilities) but only to combinations.
Related Papers (5)
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Jack Edmonds,Richard M. Karp +1 more