Sciweavers

2109 search results - page 18 / 422
» Solving Necklace Constraint Problems
Sort
View
106
Voted
JSAT
2007
47views more  JSAT 2007»
15 years 1 months ago
On Solving Boolean Combinations of UTVPI Constraints
We consider the satisfiability problem for Boolean combinations of unit two variable per inequality (UTVPI) constraints. A UTVPI constraint is linear constraint containing at mos...
Sanjit A. Seshia, K. Subramani, Randal E. Bryant
ICTAI
2008
IEEE
15 years 8 months ago
Finding Good Starting Points for Solving Structured and Unstructured Nonlinear Constrained Optimization Problems
In this paper, we develop heuristics for finding good starting points when solving large-scale nonlinear constrained optimization problems (COPs). We focus on nonlinear programmi...
Soomin Lee, Benjamin W. Wah
81
Voted
COR
2010
101views more  COR 2010»
15 years 2 months ago
Constraint-specific recovery network for solving airline recovery problems
In this paper, we consider the recovery of an airline schedule after an unforeseen event called disruption, making the planned schedule infeasible. We present a modeling framework...
Niklaus Eggenberg, Matteo Salani, Michel Bierlaire
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
15 years 7 months ago
Transition models as an incremental approach for problem solving in evolutionary algorithms
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...
NETWORKS
2008
15 years 1 months ago
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...