Volgenant A.

A. Volgenant

Information about the author A. Volgenant will soon be added to the site.
Found 22 papers in total
A branch-and-bound algorithm for the singly constrained assignment problem
A branch-and-bound algorithm for the singly constrained assignment problem
2007
The singly constrained assignment problem (SCAP) is a linear assignment problem (LAP)...
Partial enumeration in heuristics for some combinatorial optimization problems
Partial enumeration in heuristics for some combinatorial optimization problems
2007
We consider partial enumeration as a routine to improve heuristics in practice. For...
A heuristic for multiple-feeder printed circuit board manufacturing
A heuristic for multiple-feeder printed circuit board manufacturing
2006
In the considered printed circuit board (PCB) manufacturing problem, the objective is...
Some inverse optimization problems under the Hamming distance
Some inverse optimization problems under the Hamming distance
2006
Given a feasible solution to a particular combinatorial optimization problem defined...
Solving the k-cardinality assignment problem by transformation
Solving the k-cardinality assignment problem by transformation
2004
The k -cardinality Linear Assignment Problem ( k -LAP) with k a given integer is a...
Solving group Steiner problems as Steiner problems
Solving group Steiner problems as Steiner problems
2004
The generalized spanning tree or group Steiner problem (GSP) is a generalization of...
A note on the assignment problem with seniority and job priority constraints
A note on the assignment problem with seniority and job priority constraints
2004
Consider an assignment problem in which persons are qualified for a subset of the...
Improved heuristics for the traveling purchaser problem
Improved heuristics for the traveling purchaser problem
2004
For the Traveling Purchaser Problem we describe improvement subprocedures that can be...
Solving some lexicographic multi-objective combinatorial problems
Solving some lexicographic multi-objective combinatorial problems
2002
The lexicographic multi-objective optimization problem ( r -LMOP) with r (sum or...
The dynamic predicate stashing copy problem and the Steiner problem in graphs
The dynamic predicate stashing copy problem and the Steiner problem in graphs
2000
The Dynamic Predicate Stashing Copy Problem (DPSCP) is a problem about managing an...
A note on splitting of variables in integer programming models
A note on splitting of variables in integer programming models
2000
The splitting of variables in an integer programming model is a tool to obtain a more...
Improved heuristics for the n-job single-machine weighted tardiness problem
Improved heuristics for the n-job single-machine weighted tardiness problem
1999
For the n -job single-machine weighted tardiness problem a priority rule is known,...
A core approach to the 0–1 equality knapsack problem
A core approach to the 0–1 equality knapsack problem
1998
For the 0–1 knapsack problem with equality constraint a partitioning procedure...
The partial sum criterion for Steiner trees in graphs and shortest paths
The partial sum criterion for Steiner trees in graphs and shortest paths
1997
The partial sum criterion with parameter p adds up the p largest weights in the...
An addendum to the hierarchical network design problem
An addendum to the hierarchical network design problem
1996
The hierarchical network design problem is the problem to find a spanning tree of...
Linear and semi-assignment problems: A core oriented approach
Linear and semi-assignment problems: A core oriented approach
1996
A Linear Assignment Problem (LAP) with a dense cost matrix can be solved by first...
On the generalized 2-Peripatetic Salesman Problem
On the generalized 2-Peripatetic Salesman Problem
1994
Given an undirected graph the 2-Peripatetic Salesman Problem (PSP) is the problem that...
Minimum deviation and balanced optimization: A unified approach
Minimum deviation and balanced optimization: A unified approach
1991
Most combinatorial optimization problems have as criterion the sum of the weights in a...
An improved heuristic for multidimensional 0-1 knapsack problems
An improved heuristic for multidimensional 0-1 knapsack problems
1990
For the multidimensional 0-1 knapsack problem a heuristic exists, based on Lagrange...
An edge elimination test for the Steiner Problem in graphs
An edge elimination test for the Steiner Problem in graphs
1989
It is known that before actually solving the Steiner Problem in graphs, reduction...
Reducing the Hierarchical Network Design Problem
Reducing the Hierarchical Network Design Problem
1989
The Hierarchical Network Design Problem (HNDP) can be seen as a minimum spanning tree...
A Lagrangean approach to the degree-constrained minimum spanning tree problem
A Lagrangean approach to the degree-constrained minimum spanning tree problem
1989
A known branch and bound algorithm for the degree-constrained minimum spanning tree...
Papers per page: