Journal Article10.2307/2983434
19. Model Solving in Mathematical Programming
Gautam Appa,H. P. Williams +1 more
64
TL;DR: 19. Model Solving in Mathematical Programming.
read more
Abstract: 19. Model Solving in Mathematical Programming. By H. P. Williams. ISBN 0 471 93772 3 (paperbound), 0 471 93581 6 (hardbound). Wiley, Chichester, 1993. 360 pp. £19.95 (paperbound), £39.95 (hardbound).
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
Complete search in continuous global optimization and constraint satisfaction
TL;DR: This survey covers the state of the art of techniques for solving general-purpose constrained global optimization problems and continuous constraint satisfaction problems, with emphasis on complete techniques that provably find all solutions (if there are finitely many).
Inferring Electre’s veto-related parameters from outranking examples
TL;DR: This paper proposes mathematical programs to infer veto-related parameters, first considering only one criterion, then all criteria simultaneously, using the original version of Electre outranking relation and two variants, and shows that these inference procedures lead tolinear programming, 0–1 linear programming, or separable programming problems, depending on the case.
128
New math
TL;DR: The venerable math programs Maple and Mathematica long ago outgrew pure math to include numerical and symbolic math, graphics, document preparation, and more, and Maplesoft and Wolfram have each recently released a major update.
97
An application of Special Ordered Sets to a periodic milk collection problem
G.D.H. Claassen,Th.H.B. Hendriks +1 more
TL;DR: An OR-based approach to support a milk collection problem in a special branch of dairy industry and it turned out that the application of Special Ordered Sets type 1 (SOS1) was very useful.
72
An energy planning approach based on mixed 0–1 Multiple Objective Linear Programming
TL;DR: In this paper, a branch and bound algorithm based on a mixed 0-1 MOLP model is proposed to identify the number and output of each type of power units needed to satisfy the expected electricity demand in the future.
70
Related Papers (5)
George L. Nemhauser,Laurence A. Wolsey +1 more
- 01 Jan 1988
Pascal Van Hentenryck
- 01 Jan 1989
Joxan Jaffar,Michael J. Maher +1 more