A Mathematical Model for the Optimization of the Airport Check-In Service Problem Fulltext Access 8 Pages 2010
The Stochastic Guaranteed Service Model with Recourse for Multi-Echelon Warehouse Management Fulltext Access 8 Pages 2010
Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility Fulltext Access 8 Pages 2010
A particle swarm optimization approach for the bi-objective load balancing problem Fulltext Access 8 Pages 2010
An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization Fulltext Access 8 Pages 2010
Grammar-Based Integer Programming Models for Multi-Activity Shift Scheduling Fulltext Access 8 Pages 2010
A Heuristic for an Earth Observing Satellite Constellation Scheduling Problem with Download Considerations Fulltext Access 8 Pages 2010
Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors Fulltext Access 8 Pages 2010
Submodularity and Randomized rounding techniques for Optimal Experimental Design Fulltext Access 8 Pages 2010
Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks Fulltext Access 8 Pages 2010
New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem Fulltext Access 8 Pages 2010
An efficient metaheuristic to improve accessibility by rural road network planning Fulltext Access 8 Pages 2010
A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem Fulltext Access 8 Pages 2010
Convolution–multiplication identities for Tutte polynomials of graphs and matroids Fulltext Access 8 Pages 2010
Locally subquadrangular hyperplanes in symplectic and Hermitian dual polar spaces Fulltext Access 8 Pages 2010
A proof of Bressoud’s conjecture related to the Rogers–Ramanujan identities Fulltext Access 8 Pages 2010
The hardness of approximating the boxicity, cubicity and threshold dimension of a graph Fulltext Access 8 Pages 2010
Search for the best compromise solution on Multiobjective shortest path problem Fulltext Access 8 Pages 2010
A tight bound on the number of mobile servers to guarantee transferability among dominating configurations Fulltext Access 8 Pages 2010
A new approximation algorithm for the multilevel facility location problem Fulltext Access 8 Pages 2010
The minimax problem solving of physical fields sources allocation in specified positions Fulltext Access 8 Pages 2010
On a bi-level formulation to protect uncapacitated p-median systems with facility recovery time and frequent disruptions Fulltext Access 8 Pages 2010
An integer programming model for the Minimum Interval Graph Completion Problem Fulltext Access 8 Pages 2010
The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs Fulltext Access 8 Pages 2010
The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems Fulltext Access 8 Pages 2010
Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines Fulltext Access 8 Pages 2010
A Differential Evolution Algorithm for the Winner Determination Problem in Combinatorial Auctions Fulltext Access 8 Pages 2010
A branch-and-cut approach to the repetition-free longest common subsequence problem Fulltext Access 8 Pages 2010
Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph Fulltext Access 8 Pages 2010
A linear equation for Minkowski sums of polytopes relatively in general position Fulltext Access 9 Pages 2010
The non-existence of certain skew-symmetric amorphous association schemes Fulltext Access 9 Pages 2010