Sciweavers

706 search results - page 43 / 142
» Super Solutions in Constraint Programming
Sort
View
CPAIOR
2006
Springer
15 years 3 months ago
Duality in Optimization and Constraint Satisfaction
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
John N. Hooker
CEC
2008
IEEE
15 years 6 months ago
EA-MP: An evolutionary algorithm for a mine planning problem
In this paper we introduce an evolutionary algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear integer p...
María-Cristina Riff, Teddy Alfaro, Xavier B...
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 3 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
ANOR
2005
124views more  ANOR 2005»
14 years 11 months ago
On Compact Formulations for Integer Programs Solved by Column Generation
Column generation has become a powerful tool in solving large scale integer programs. It is well known that most of the often reported compatibility issues between pricing subprobl...
Daniel Villeneuve, Jacques Desrosiers, Marco E. L&...
CP
2007
Springer
15 years 6 months ago
Breaking Symmetry of Interchangeable Variables and Values
Abstract. A common type of symmetry is when both variables and values partition into interchangeable sets. Polynomial methods have been introduced to eliminate all symmetric soluti...
Yat Chiu Law, Jimmy Ho-Man Lee, Toby Walsh, J. Y. ...