56 search results - page 4 / 12 » On Compact Formulations for Integer Programs Solved by Colum... |
ASPDAC
1998
ACM
13 years 11 months ago
1998
ACM
— Test Pattern Generation for combinational circuits entails the identification of primary input assignments for detecting each fault in a set of target faults. An extension to ...
COR
2008
13 years 7 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
ATMOS
2010
13 years 6 months ago
2010
In this paper we address a real world optimisation problem, the Rail Track Inspection Scheduling Problem (RTISP). This problem consists of scheduling network inspection tasks. The...
DISOPT
2008
13 years 7 months ago
2008
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
COR
2007
13 years 7 months ago
2007
This paper considers the design of two-layered fully interconnected networks.A two-layered network consists of clusters of nodes, each defining an access network and a backbone n...