Sciweavers

Share
31 search results - page 1 / 7
» A 0 1 Integer Programming Model for the Office Space Allocat...
Sort
View
ENDM
2010
126views more  ENDM 2010»
9 years 7 months ago
A 0/1 Integer Programming Model for the Office Space Allocation Problem
We propose a 0/1 integer programming model to tackle the office space allocation (OSA) problem which refers to assigning room space to a set of entities (people, machines, roles, ...
Özgür Ülker, Dario Landa-Silva
CP
2005
Springer
10 years 16 days ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
CPAIOR
2006
Springer
9 years 10 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
CORR
2011
Springer
220views Education» more  CORR 2011»
9 years 2 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers
IPPS
2003
IEEE
10 years 8 days ago
MIP Formulation for Robust Resource Allocation in Dynamic Real-Time Systems
Real-time systems usually operate in an environment that changes continuously. These changes cause the performance of the system to vary during run time. An allocation of resource...
Sethavidh Gertphol, Viktor K. Prasanna
books