Sciweavers

327 search results - page 30 / 66
» Cutting planes in integer and mixed integer programming
Sort
View
DATE
2009
IEEE
122views Hardware» more  DATE 2009»
15 years 8 months ago
A MILP-based approach to path sensitization of embedded software
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
José C. Costa, José C. Monteiro
AIPS
2011
14 years 4 months ago
Scheduling an Aircraft Repair Shop
We address a scheduling problem in the context of military aircraft maintenance where the goal is to meet the aircraft requirements for a number of missions in the presence of bre...
Maliheh Aramon Bajestani, J. Christopher Beck
CADE
2009
Springer
16 years 1 months ago
A Generalization of Semenov's Theorem to Automata over Real Numbers
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
Bernard Boigelot, Jérôme Leroux, Juli...
ISAAC
1992
Springer
132views Algorithms» more  ISAAC 1992»
15 years 5 months ago
Generalized Assignment Problems
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
Silvano Martello, Paolo Toth
MP
2006
88views more  MP 2006»
15 years 1 months ago
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCorm...