Minimal vertex separators and new characterizations for dually chordal graphs Fulltext Access 6 Pages 2009
Properties of an Approximability-related Parameter on Circular Complete Graphs Fulltext Access 6 Pages 2009
Strength of facets for the set covering and set packing polyhedra on circulant matrices Fulltext Access 6 Pages 2009
A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem Fulltext Access 6 Pages 2009
Upper and lower bounding procedures for the minimum caterpillar spanning problem Fulltext Access 6 Pages 2009
On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs Fulltext Access 6 Pages 2009
Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized Fulltext Access 6 Pages 2009
The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes Fulltext Access 6 Pages 2009
The number of convergent graphs under the biclique operator with no twin vertices is finite Fulltext Access 6 Pages 2009
A Characterization of Graphs with Fractional Total Chromatic Number Equal to Δ+2 Fulltext Access 6 Pages 2009
Optimizing the throughput, service rate, and buffer allocation in finite queueing networks Fulltext Access 6 Pages 2009
The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks Fulltext Access 6 Pages 2009
The minimum number of ee-vertex-covers among hypergraphs with ee edges of given ranks Fulltext Access 6 Pages 2009
Listing minimal edge-covers of intersecting families with applications to connectivity problems Fulltext Access 6 Pages 2009
Upper bounds of degree 3 for the probability of the union of events via linear programming Fulltext Access 6 Pages 2009
Upper bounds on the kk-domination number and the kk-Roman domination number Fulltext Access 6 Pages 2009
Covering skew-supermodular functions by hypergraphs of minimum total size Fulltext Access 6 Pages 2009
Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs Fulltext Access 6 Pages 2009
Graph homomorphisms, the Tutte polynomial and “q-state Potts uniqueness” Fulltext Access 6 Pages 2009
A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows Fulltext Access 6 Pages 2009
An improved Benders decomposition applied to a multi-layer network design problem Fulltext Access 6 Pages 2009
A powerful route minimization heuristic for the vehicle routing problem with time windows Fulltext Access 6 Pages 2009
Scheduling jobs with release dates on parallel batch processing machines Fulltext Access 6 Pages 2009
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints Fulltext Access 6 Pages 2009