Sciweavers

13841 search results - page 80 / 2769
» Algorithms and Constraint Programming
Sort
View
SIAMJO
2010
136views more  SIAMJO 2010»
14 years 7 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López
136
Voted
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 4 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
ANOR
2007
108views more  ANOR 2007»
15 years 20 days ago
Towards a practical engineering tool for rostering
The profitability and morale of many organizations (such as factories, hospitals and airlines) are affected by their ability to schedule their personnel properly. Sophisticated an...
Edward P. K. Tsang, John A. Ford, Patrick Mills, R...
80
Voted
SIAMJO
2008
99views more  SIAMJO 2008»
15 years 13 days ago
The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
Marco C. Campi, Simone Garatti
98
Voted
JAIR
2008
98views more  JAIR 2008»
15 years 16 days ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...