Country: Netherlands

Found 18376 papers in total
A continuous method for convex programming problems
A continuous method for convex programming problems
2005,
In this paper, we present a continuous method for convex programming (CP) problems....
Multidimensional dual dynamic programming
Multidimensional dual dynamic programming
2005,
In this paper, we develop a dual approach to the dynamic programming for the optimal...
Modeling staff scheduling problems. A tutorial
Modeling staff scheduling problems. A tutorial
2004,
This tutorial gives an introduction to staff scheduling problems. It is meant to be...
The best-choice problem for partially ordered objects
The best-choice problem for partially ordered objects
1999,
We consider the problem of making a single on-line selection from a random sequence of...
Shipment partitioning and routing to minimize makespan in a transportation network
Shipment partitioning and routing to minimize makespan in a transportation network
2005,
This paper addresses the problem of partitioning and transporting a shipment of known...
A geometric programming framework for univariate cubic L1 smoothing splines
A geometric programming framework for univariate cubic L1 smoothing splines
2005,
Univariate cubic L 1 smoothing splines are capable of providing shape-preserving C 1...
Stronger K-tree relaxations for the vehicle routing problem
Stronger K-tree relaxations for the vehicle routing problem
2004,
A Lagrangian based exact solution algorithm for the vehicle routing problem (VRP),...
A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problem
A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problem
2004,
Corrected Miller–Tucker–Zemlin type subtour elimination constraints for...
Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
2000,
The well-studied 0/1 Knapsack and Subset-Sum problem are maximization problems that...
A multi-start local search algorithm for the vehicle routing problem with time windows
A multi-start local search algorithm for the vehicle routing problem with time windows
2004,
In this paper a multi-start local search (MSLS) heuristic is proposed for the vehicle...
Valid integer polytope (VIP) penalties for branch-and-bound enumeration
Valid integer polytope (VIP) penalties for branch-and-bound enumeration
2000,
We introduce new penalties, called valid integer polytope (VIP) penalties, that...
Linear-time-approximation algorithms for bin packing
Linear-time-approximation algorithms for bin packing
2000,
Simchi–Levi proved that the famous bin packing algorithms FF and BF have an...
Using xQx to model and solve the uncapacitated task allocation problem
Using xQx to model and solve the uncapacitated task allocation problem
2005,
This paper illustrates how large instances of the unconstrained task allocation...
The sagitta method for solving linear programs
The sagitta method for solving linear programs
2004,
A new non-simplex active-set method for solving linear programs is presented. This...
Computational results with a primal–dual subproblem simplex method
Computational results with a primal–dual subproblem simplex method
1999,
The two main ideas implemented are a primal–dual subproblem simplex method and a...
Forward chaining is simple (x)
Forward chaining is simple (x)
2000,
We show that Forward Chaining in Horn Systems is merely the Simplex Algorithm,...
Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights
Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights
2000,
While properties of the weighted central path for linear and non-linear programs have...
Linear programming with variable matrix entries
Linear programming with variable matrix entries
2005,
We consider linear programming (continuous or integer) where some matrix entries are...
The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
2005,
The DC programming and its DC algorithm (DCA) address the problem of minimizing a...
Parameter-free dual models for fractional programming with generalized invexity
Parameter-free dual models for fractional programming with generalized invexity
2005,
By parameter-free approach, we establish sufficient optimality conditions for...
A modified relaxation scheme for mathematical programs with complementarity constraints
A modified relaxation scheme for mathematical programs with complementarity constraints
2005,
In this paper, we consider a mathematical program with complementarity constraints. We...
Interactive multiobjective agro-ecological land use planning: The Bungoma region in Kenya
Interactive multiobjective agro-ecological land use planning: The Bungoma region in Kenya
2004,
The development of a third world country requires a conscious balance between...
A unified class of directly solvable semidefinite programming problems
A unified class of directly solvable semidefinite programming problems
2005,
We propose a class of semidefinite programming (SDP) problems for which an optimal...
Application of fuzzy optimization to diet problems in Argentinean farms
Application of fuzzy optimization to diet problems in Argentinean farms
2004,
The problem of designing diets for cattle in an Argentinean farm is addressed in this...
Papers per page: