Sciweavers

969 search results - page 10 / 194
» Programming as Problem Solving: A Participatory Theater Appr...
Sort
View
ANOR
2011
96views more  ANOR 2011»
13 years 2 months ago
Global propagation of side constraints for solving over-constrained problems
This article deals with the resolution of over-constrained problems using constraint programming, which often imposes to add to the constraint network new side constraints. These ...
Thierry Petit, Emmanuel Poder
IPCO
2008
221views Optimization» more  IPCO 2008»
13 years 9 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
MP
2007
75views more  MP 2007»
13 years 7 months ago
Solving maximum-entropy sampling problems using factored masks
We present a practical approach to Anstreicher and Lee’s masked spectral bound for maximum-entropy sampling, and we describe favorable results that we have obtained with a Branch...
Samuel Burer, Jon Lee
COR
2008
128views more  COR 2008»
13 years 7 months ago
Solving dynamic stochastic economic models by mathematical programming decomposition methods
Discrete-time optimal control problems arise naturally in many economic problems. Despite the rapid growth in computing power and new developments in the literature, many economic...
Mercedes Esteban-Bravo, Francisco J. Nogales
ESA
2010
Springer
162views Algorithms» more  ESA 2010»
13 years 7 months ago
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods
We report on the solution of a real-time scheduling problem that arises in the design of software-based operation control of aircraft. A set of tasks has to be distributed on a min...
Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S....