Branch-and-check: A hybrid framework integrating mixed integer programming and constraint logic programming
ES Thorsteinsson - Principles and Practice of Constraint Programming …, 2001 - Springer
Abstract We present Branch-and-Check, a hybrid framework integrating Mixed Integer
Programming and Constraint Logic Programming, which encapsulates the traditional …
Programming and Constraint Logic Programming, which encapsulates the traditional …
Constraint logic programming
M Wallace - Computational Logic: Logic Programming and Beyond …, 2002 - Springer
Abstract Constraint Logic Programming (CLP) extends logic programming in two ways.
Firstly it admits special predicates called constraints, which are not defined by clauses, but …
Firstly it admits special predicates called constraints, which are not defined by clauses, but …
Network flow problems in constraint programming
A Bockmayr, N Pisaruk, A Aggoun - … 26–December 1, 2001 Proceedings 7, 2001 - Springer
Network Flow Problems in Constraint Programming Page 1 Network Flow Problems in
Constraint Programming Alexander Bockmayr1, Nicolai Pisaruk1, and Abderrahmane …
Constraint Programming Alexander Bockmayr1, Nicolai Pisaruk1, and Abderrahmane …
[PDF][PDF] Exact methods for solving traveling salesman problems with pickup and delivery in real time
Abstract The Traveling Salesman Problem with Pickup and Delivery (TSPPD) describes the
problem of finding a minimum cost path in which pickups precede their associated …
problem of finding a minimum cost path in which pickups precede their associated …
Integrating symmetry, dominance, and bound-and-bound in a multiple knapsack solver
AS Fukunaga - Integration of AI and OR Techniques in Constraint …, 2008 - Springer
The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A
recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, branch-and …
recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, branch-and …
Cost propagation–numerical propagation for optimization problems
B Grohe, D Wedelin - International Conference on Integration of Artificial …, 2008 - Springer
We investigate cost propagation for solving combinatorial optimization problems with finite
domain variables, expressed as an additive component model. Cost propagation combines …
domain variables, expressed as an additive component model. Cost propagation combines …
Exact Methods for Solving Single-Vehicle Pickup and Delivery Problems in Real Time
RJ O'Neil - 2018 - search.proquest.com
Abstract The Traveling Salesman Problem with Pickup and Delivery (TSPPD) describes the
problem of finding a minimum cost path in which pickups precede their associated …
problem of finding a minimum cost path in which pickups precede their associated …
[PDF][PDF] Integration of a Multicriteria Decision Model in Constraint Programming
F Le Huédé, P Gérard, M Grabisch… - In Proceedings of …, 2002 - aips02.icaps-conference.org
In this paper we propose an integration scheme for the modeling of preferences with a fuzzy
measure and the Choquet integral in Constraint Programming (CP). In order to use the …
measure and the Choquet integral in Constraint Programming (CP). In order to use the …
[PDF][PDF] Hybrids of stochastic metaheuristics and constraint programming for combinatorial optimization
DR Thiruvady - 2012 - bayesian-intelligence.com
Combinatorial optimization problems (COPs) are important in scientific and industrial
applications. These problems commonly appear in practical settings such as timetabling …
applications. These problems commonly appear in practical settings such as timetabling …
[图书][B] A corpus-based approach for cross-lingual information retrieval
KW Li - 2004 - search.proquest.com
With the increasing amount of online information, information retrieval systems must manage
large volumes of data and information, often written in different languages and stored in …
large volumes of data and information, often written in different languages and stored in …