The positive circuits of oriented matroids with the packing property or idealness Fulltext Access 8 Pages 2010
A Continuous Strategy to Solve a Class of Discrete Optimization Problems Fulltext Access 8 Pages 2010
A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming Fulltext Access 8 Pages 2010
A post-optimization method to route scheduled lightpath demands with multiplicity Fulltext Access 8 Pages 2010
Cross line and column generation for the cut covering problem in wireless networks Fulltext Access 8 Pages 2010
Estimating the relevance on Communication Lines Based on the Number of Edge Covers Fulltext Access 8 Pages 2010
An exact algorithm for the Minimum Power Multicasting Problem in Wireless Sensor Networks Fulltext Access 8 Pages 2010
Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs Fulltext Access 8 Pages 2010
Covering oriented points in the plane with orthogonal polygons is NP-complete Fulltext Access 8 Pages 2010
Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling Fulltext Access 8 Pages 2010
The biclique k-clustering problem in bipartite graphs and its application in bioinformatics Fulltext Access 8 Pages 2010
Exposing Metaheuristics as Web Services in Distributed Systems using OpenCF Fulltext Access 8 Pages 2010
On a particular case of the multi-criteria unconstrained optimization problem Fulltext Access 8 Pages 2010
Automatic Selection of Beam Orientations in Intensity-Modulated Radiation Therapy Fulltext Access 8 Pages 2010
Speculative data prefetching for branching structures in dataflow programms Fulltext Access 8 Pages 2010
A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems Fulltext Access 8 Pages 2010
Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint Fulltext Access 8 Pages 2010
Variable Parameters Lengths Genetic Algorithm for Minimizing Earliness-Tardiness Penalties of Single Machine Scheduling With a Common Due Date Fulltext Access 8 Pages 2010
Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem Fulltext Access 8 Pages 2010
Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study Fulltext Access 8 Pages 2010
Scheduling on parallel machines considering job-machine dependency constraints Fulltext Access 8 Pages 2010
Large-scale multi-period precedence constrained knapsack problem: A mining application Fulltext Access 8 Pages 2010
Solving Replica Placement and Request Distribution in Content Distribution Networks Fulltext Access 8 Pages 2010
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges Fulltext Access 8 Pages 2010
A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem Fulltext Access 8 Pages 2010
IP-Based Energetic Reasoning for the Resource Constrained Project Scheduling Problem Fulltext Access 8 Pages 2010
A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization Fulltext Access 8 Pages 2010
Consecutive ones matrices for multi-dimensional orthogonal packing problems Fulltext Access 8 Pages 2010
A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows Fulltext Access 8 Pages 2010
Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm Fulltext Access 8 Pages 2010
Polynomial-time dualization of rr-exact hypergraphs with applications in geometry Fulltext Access 8 Pages 2010
Lower bounds for the domination number and the total domination number of direct product graphs Fulltext Access 8 Pages 2010
Simultaneous Balancing and Scheduling of Flexible Mixed Model Assembly Lines with Sequence-Dependent Setup Times Fulltext Access 8 Pages 2010
Tree based heuristics for the preemptive asymmetric stacker crane problem Fulltext Access 8 Pages 2010
Discrete optimization methods to determine trajectories for Dubins' vehicles Fulltext Access 8 Pages 2010
Total edge irregularity strength of complete graphs and complete bipartite graphs Fulltext Access 8 Pages 2010
The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs Fulltext Access 8 Pages 2010
Combinatorial proofs of an identity from Ramanujan’s lost notebook and its variations Fulltext Access 8 Pages 2010
Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable Fulltext Access 8 Pages 2010