Mixed logical-linear programming
John N. Hooker,Maria A. Osorio +1 more
TL;DR: Previous work is surveyed and potential advantages of MLLP's wider choice of modeling and solution options are articulated and some of them are illustrated with computational experiments.
read more
About: This article is published in Discrete Applied Mathematics. The article was published on 15 Oct 1999. and is currently open access. The article focuses on the topics: Branch and price & Functional logic programming.
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
•Book
Handbook of Constraint Programming
Francesca Rossi,Peter van Beek,Toby Walsh +2 more
- 01 Jan 2006
TL;DR: Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.
Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques
TL;DR: In this article, a unified overview and derivation of mixed-integer nonlinear programming (MINLP) techniques, such as Branch and Bound, Outer-Approximation, Generalized Benders and Extended Cutting Plane methods, as applied to nonlinear discrete optimization problems that are expressed in algebraic form is presented.
Scope for industrial applications of production scheduling models and solution methods
Iiro Harjunkoski,Christos T. Maravelias,Peter Bongers,Pedro M. Castro,Sebastian Engell,Ignacio E. Grossmann,John N. Hooker,Carlos A. Méndez,Guido Sand,John M. Wassick +9 more
TL;DR: The aim of the paper is to focus on the industrial aspects of scheduling and discuss the main characteristics, including strengths and weaknesses of the presented approaches, as well as some lessons learned from industry.
511
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Gianni Codato,Matteo Fischetti +1 more
TL;DR: Computational results on two specific classes of hard-to-solve MIPs indicate that the new method produces a reformulation which can be solved some orders of magnitude faster than the original MIP model.
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
Vipul Jain,Ignacio E. Grossmann +1 more
TL;DR: The goal of this paper is to develop models and methods that use complementary strengths of Mixed Integer Linear Programming (MILP) and Constraint Programming (CP) techniques to solve problems that are otherwise intractable if solved using either of the two methods.
References
A 2dvEv- bit distributed algorithm for the directed Euler trail problem
Wen-Huei Chen,Chuan Yi Tang +1 more
TL;DR: The algorithm can be used as a building block for solving other distributed graph problems, and can be slightly modified to run on a strongly-connected diagraph for generating the existent Euler trail or to report that no Euler trails exist.
14K
A Machine-Oriented Logic Based on the Resolution Principle
TL;DR: The paper concludes with a discussion of several principles which are applicable to the design of efficient proof-procedures employing resolution as the basle logical process.
4.4K
•Book
Foundations of Constraint Satisfaction
Edward Tsang
- 01 Aug 1993
TL;DR: Introduction to the C SP CSP solving - an overview chapter fundamental concepts of the CSP chapter problem reduction chapter basic search strategies for solving CSPs search orders in searching in C SPs exploitation of problem specific features stochastic search methods.
2K
Constraint logic programming
Joxan Jaffar,Jean-Louis Lassez +1 more
- 01 Oct 1987
TL;DR: In this article, a class of logic programming languages, called CLP languages, are defined, all of which share the same essential semantic properties and are based on a unified formal semantics.
1.7K
•Book
Constraint satisfaction in logic programming
Pascal Van Hentenryck
- 01 Jan 1989
TL;DR: Van Hentenryck as mentioned in this paper proposes a new approach to solving discrete combinatorial problems using consistency techniques. But this approach is not suitable for many real-world problems, such as disjunctive scheduling, warehouse location, cutting stock car sequencing, and microcode labeling.
1.3K