Open Access
A Note on Zero-One Programming
Manfred Padberg
- 01 Jan 2016
TL;DR: 1. W. COHEN, The Single Server Queue, American Elsevier, New York, 1969; D. R. Cox, Renewal Theory, Wiley,New York, 1962.
read more
Abstract: 1. J. W. COHEN, The Single Server Queue, American Elsevier, New York, 1969. 2. D. R. Cox, Renewal Theory, Wiley, New York, 1962. 3. D. R. COX AND W. L. SMITH, Queues, Wiley, New York, 1961. 4. W. FELLER, An Introduction to Probability Theory and its Applications, Vol. II, Wiley, New York, 1966. 5. J. KEILSON, "The General Bulk Queue as a Hilbert Problem," J. Roy. Statist. Soc. Ser. B, 24, 344-358 (1962). 6. L. KOSTEN, Stochastic Theory of Service Systems, Pergamon Press, Oxford, 1973. 7. P. LEGALL, Les Systemes Avec ou Sans Attente, Dunod, Paris, 1962.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Chance-Constrained Binary Packing Problems
TL;DR: This work considers a class of packing problems with uncertain data, which it refers to as the chance-constrained binary packing problem, and proposes a problem formulation in its original space based on the so-called probabilistic covers.
111
Generalized multiple depot traveling salesmen problem-Polyhedral study and exact algorithm
TL;DR: In this article, the generalized multiple depot traveling salesmen problem (GMDTSP) is formulated as a mixed integer linear program and an exact algorithm based on the branch-and-cut framework is developed.
51
Efficient reformulation for 0-1 programs: methods and computational results
TL;DR: This work introduces two general methods for 0–1 program reformulation that provide a unifying interpretation of many previously described automatic reformulation methods, and describes several easy applications of these methods.
40
Risk-Averse Shortest Path Interdiction
Yongjia Song,Siqian Shen +1 more
TL;DR: A branch-and-cut algorithm is proposed and lifting techniques are applied to exploit the combinatorial structure of the risk-averse leader’s interdiction problem to solve the Stackelberg game problem.
39
•Posted Content
Generalized multiple depot traveling salesmen problem - polyhedral study and exact algorithm
TL;DR: An integer programming formulation for the GMDTSP and valid inequalities to strengthen the linear programming relaxation are presented and a branch-and-cut algorithm is developed to obtain optimal solutions to the problem.
31
References
On the facial structure of set packing polyhedra
TL;DR: This paper shows that the cliques of the intersection graph provide a first set of facets for the polyhedron in question, and it is shown that the cycles without chords of odd length of the intersections graph give rise to a further set of facet.
665
Facets of the knapsack polytope
TL;DR: A necessary and sufficient condition is given for an inequality with coefficients 0 or 1 to define a facet of the knapsack polytope, i.e., of the convex hull of 0–1 points satisfying a given linear inequality.
450
Properties of vertex packing and independence system polyhedra
TL;DR: A general class of facets of = convex hull{x∈Rn:Ax≤1m,x binary} is described which subsumes a class examined by Padberg [13].
381
Faces for linear inequalities in 0-1 variables
TL;DR: Special subclasses of inequalities for which all faces can be generated are demonstrated, including the “matroidal” and “graphic” inequalities, where a count on the number of such inequalities is obtained, and inequalities where all Faces can be derived from lower dimensional faces.
354