Country: Netherlands

Found 18376 papers in total
A preemptive priority queue with balking
A preemptive priority queue with balking
2005,
This paper analyzes a 2-class, single-server preemptive priority queueing model with...
The multiple Traveling Salesman Problem with time windows: vehicle bounds based on precedence graphs
The multiple Traveling Salesman Problem with time windows: vehicle bounds based on precedence graphs
2006,
Vehicle bounds for the multiple traveling salesman problem with time windows are found...
The traveling salesman problem with few inner points
The traveling salesman problem with few inner points
2006,
We propose two algorithms for the planar Euclidean traveling salesman problem. The...
Reducing quadratic programming problem to regression problem: Stepwise algorithm
Reducing quadratic programming problem to regression problem: Stepwise algorithm
2005,
Quadratic programming is concerned with minimizing a convex quadratic function subject...
“Miniaturized” linearizations for quadratic 0/1 problems
“Miniaturized” linearizations for quadratic 0/1 problems
2005,
In order to solve a quadratic 0/1 problem, some techniques, consisting in deriving a...
Second order symmetric duality in non-differentiable multiobjective programming with F-convexity
Second order symmetric duality in non-differentiable multiobjective programming with F-convexity
2005,
This paper is concerned with a pair of Mond–Weir type second order symmetric...
An ϵ-sensitivity analysis for semidefinite programming
An ϵ-sensitivity analysis for semidefinite programming
2005,
We extend the concept of ϵ-sensitivity analysis developed for linear programming...
Criteria for generalized invex monotonicities
Criteria for generalized invex monotonicities
2005,
In this paper, under appropriate conditions, we establish that (i) if the gradient of...
Resource augmentation in two-dimensional packing with orthogonal rotations
Resource augmentation in two-dimensional packing with orthogonal rotations
2006,
We consider the problem of packing two-dimensional rectangles into the minimum number...
Improved results on the 0–1 multidimensional knapsack problem
Improved results on the 0–1 multidimensional knapsack problem
2005,
Geometric constraint and cutting planes have been successfully used to solve the...
A co-operative parallel heuristic for mixed zero–one linear programming: Combining simulated annealing with branch and bound
A co-operative parallel heuristic for mixed zero–one linear programming: Combining simulated annealing with branch and bound
2005,
This paper considers the exact approach of branch and bound (B&B) and the...
Non delayed relax-and-cut algorithms
Non delayed relax-and-cut algorithms
2005,
Attempts to allow exponentially many inequalities to be candidates to Lagrangian...
Logical processing for integer programming
Logical processing for integer programming
2005,
This paper reviews tools which have great potential for reducing the difficulty of...
Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
2005,
This paper studies the polyhedral structure of dynamic fixed-charge problems that have...
Projection, lifting and extended formulation in integer and combinatorial optimization
Projection, lifting and extended formulation in integer and combinatorial optimization
2005,
This is an overview of the significance and main uses of projection, lifting and...
Integer-programming software systems
Integer-programming software systems
2005,
Recent developments in integer-programming software systems have tremendously improved...
A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
2005,
We consider linear mixed-integer programs where a subset of the variables are...
Order preserving reductions and polynomial improving paths
Order preserving reductions and polynomial improving paths
2006,
This paper shows that neighborhood transformations and data-independent order...
A 2-approximation algorithm for the network substitution problem
A 2-approximation algorithm for the network substitution problem
2006,
The network substitution problem is to substitute an existing network for a new...
The robust shortest path problem in series–parallel multidigraphs with interval data
The robust shortest path problem in series–parallel multidigraphs with interval data
2006,
In this paper the robust shortest path problem in edge series–parallel...
Accelerated label setting algorithms for the elementary resource constrained shortest path problem
Accelerated label setting algorithms for the elementary resource constrained shortest path problem
2006,
A label setting algorithm for solving the Elementary Resource Constrained Shortest...
The shortest path problem with forbidden paths
The shortest path problem with forbidden paths
2005,
We consider a variant of the constrained shortest path problem, where the constraints...
An improved algorithm for decomposing arc flows into multipath flows
An improved algorithm for decomposing arc flows into multipath flows
2006,
We consider a multipath maximum flow problem introduced by Kishimoto. The focus is on...
Quadratic cost flow and the conjugate gradient method
Quadratic cost flow and the conjugate gradient method
2005,
By introducing quadratic penalty terms, a convex non-separable quadratic network...
Papers per page: