Journal ArticleDOI
A Selection Problem of Shared Fixed Costs and Network Flows
TLDR
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.Citations
More filters
Journal ArticleDOI
Planning for Conjunctive Goals
TL;DR: Theorems that suggest that efficient general purpose planning with more expressive action representations is impossible are presented, and ways to avoid this problem are suggested.
Journal ArticleDOI
Pseudo-boolean optimization
Endre Boros,Peter L. Hammer +1 more
TL;DR: This survey examines the state of the art of a variety of problems related to pseudo-Boolean optimization, i.e. to the optimization of set functions represented by closed algebraic expressions.
Journal ArticleDOI
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
TL;DR: This work gives a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle that does not use the ellipsoid method or any other linear programming method.
Journal ArticleDOI
A fast parametric maximum flow algorithm and applications
TL;DR: It is shown that the recent maximum flow algorithm of Goldberg and Tarjan can be extended to solve an important class of such parametric maximum flow problems, at the cost of only a constant factor in its worst-case time bound.
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.
References
More filters
Book
Flows in networks
D. R. Ford,D. R. Fulkerson +1 more
TL;DR: Ford and Fulkerson as mentioned in this paper set the foundation for the study of network flow problems and developed powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming.
Journal ArticleDOI
Flows in Networks.
TL;DR: The techniques presented by Ford and Fulkerson spurred the development of powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming.
Book
The theory of graphs and its applications
TL;DR: This book on the theory of graphs provides the reader with a mathematical tool which can be used in the behavioral sciences, in the theoryof information, cybernetics, games, transport networks, as well as in set theory and matrix theory.
Journal ArticleDOI
Characterization of totally unimodular matrices
TL;DR: Gouila-Houri and Gomory as discussed by the authors gave a new proof of the sufficient condition of Statement 3 at the Seminary on Combinatorial Problems of the Faculté des Sciences de Paris in January 1962.
Journal ArticleDOI
Notes—On a Selection Problem
TL;DR: 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.