Stabilized branch-and-cut-and-price for the generalized assignment problem Fulltext Access 7 Pages 2005
Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph Fulltext Access 7 Pages 2005
On the asymmetric representatives formulation for the vertex coloring problem Fulltext Access 7 Pages 2005
Proof Transformation via Interpretation Functions: Results, Problems and Applications Fulltext Access 7 Pages 2005
Coloring the vertices of a graph with measurable sets in a probability space Fulltext Access 7 Pages 2005
The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation Fulltext Access 7 Pages 2005
A multistart constructive heuristic for sequencing by hybridization using adaptive memory Fulltext Access 7 Pages 2005
Computing the integrality gap of the asymmetric travelling salesman problem Fulltext Access 7 Pages 2005
Optimal flow distribution among multiple channels with unknown capacities Fulltext Access 7 Pages 2005
Multiplicative graphs and semi-lattice endomorphisms in the category of graphs Fulltext Access 8 Pages 2005
Optimal preemptive scheduling on a fixed number of identical parallel machines Fulltext Access 8 Pages 2005
Heavy-traffic asymptotics for the single-server queue with random order of service Fulltext Access 8 Pages 2005
Analysis of optimal and nearly optimal sequencing policies for a closed queueing network Fulltext Access 8 Pages 2005
Existence of efficient solutions in infinite horizon optimization under continuous and discrete controls Fulltext Access 8 Pages 2005
Minimizing makespan on a single batching machine with release times and non-identical job sizes Fulltext Access 8 Pages 2005
The minimum period of the Ehrhart quasi-polynomial of a rational polytope Fulltext Access 8 Pages 2005
The ErdÅs-Menger conjecture for source/sink sets with disjoint closures Fulltext Access 8 Pages 2005
Biplanes with flag-transitive automorphism groups of almost simple type, with alternating or sporadic socle Fulltext Access 8 Pages 2005
A distance regular graph with intersection array (21,16,8;1,4,14) does not exist Fulltext Access 8 Pages 2005
Minimizing makespan with release times on identical parallel batching machines Fulltext Access 8 Pages 2005