The following pages link to A. Volgenant (Q609824):
Displaying 50 items.
- On scheduling a single machine with resource dependent release times (Q609825) (← links)
- Symmetric traveling salesman problems (Q721684) (← links)
- On a pair of job-machine assignment problems with two stages (Q732901) (← links)
- On dual solutions of the linear assignment problem (Q761971) (← links)
- Minimum deviation and balanced optimization: A unified approach (Q806674) (← links)
- An addendum on the incremental assignment problem (Q1007874) (← links)
- Solving the 2-rooted mini-max spanning forest problem by branch-and-bound (Q1043334) (← links)
- Improved polynomial algorithms for robust bottleneck problems with interval data (Q1046706) (← links)
- A note on finding a shortest complete cycle in an undirected graph (Q1069451) (← links)
- A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
- An edge elimination test for the Steiner problem in graphs (Q1116902) (← links)
- Reducing the hierarchical network design problem (Q1121181) (← links)
- A Lagrangean approach to the degree-constrained minimum spanning tree problem (Q1121788) (← links)
- Solving symmetric vehicle routing problems asymmetrically (Q1171005) (← links)
- An addendum to the hierarchical network design problem (Q1268252) (← links)
- The partial sum criterion for Steiner trees in graphs and shortest paths (Q1278596) (← links)
- Improved heuristics for the \(n\)-job single-machine weighted tardiness problem (Q1302708) (← links)
- On the generalized 2-peripatetic salesman problem (Q1328613) (← links)
- Solving group Steiner problems as Steiner problems. (Q1420439) (← links)
- A note on the assignment problem with seniority and job priority constraints. (Q1420440) (← links)
- Improved heuristics for the traveling purchaser problem. (Q1422388) (← links)
- The dynamic predicate stashing copy problem and the Steiner problem in graphs (Q1582038) (← links)
- Solving some lexicographic multi-objective combinatorial problems (Q1598728) (← links)
- Linear assignment procedures (Q1610146) (← links)
- Solving the \(k\)-cardinality assignment problem by transformation (Q1877052) (← links)
- On Steiner versions of (bi)connectivity in network problems (Q1889834) (← links)
- On weighting two criteria with a parameter in combinatorial optimization problems (Q1926813) (← links)
- A note on splitting of variables in integer programming models (Q1972004) (← links)
- Solving the rectangular assignment problem and applications (Q2430614) (← links)
- A branch-and-bound algorithm for the singly constrained assignment problem (Q2432890) (← links)
- Linear and semi-assignment problems: A core oriented approach (Q2563894) (← links)
- An addendum on: ``Sensitivity analysis of the optimal assignment'' (Q2569122) (← links)
- Some inverse optimization problems under the Hamming distance (Q2575571) (← links)
- (Q3157645) (← links)
- A heuristic for multiple-feeder PCB manufacturing (Q3182668) (← links)
- Optimal Claiming in an Automobile Insurance System with Bonus-Malus Structure (Q3221246) (← links)
- Technical Note—A Note on Parametric Analysis in Linear Assignment (Q3392188) (← links)
- (Q3481517) (← links)
- Improving Christofides' lower bound for the traveling salesman problem (Q3698662) (← links)
- Better assignment lower bounds for the Euclidean traveling salesman problem (Q3771999) (← links)
- Some generalizations of the steiner problem in graphs (Q3787806) (← links)
- Reduction tests for the steiner problem in grapsh (Q3826622) (← links)
- Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem (Q3885528) (← links)
- (Q4206568) (← links)
- Well-solved cases of the 2-peripatetic salesman problem (Q4351794) (← links)
- (Q4733695) (← links)
- An addendum to the most vital edges of matching in a bipartite graph (Q4887756) (← links)
- The edge-disjoing steiner problem in graphs (Q4893707) (← links)
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems (Q5202507) (← links)
- Partial enumeration in heuristics for some combinatorial optimization problems (Q5292805) (← links)
