A. Volgenant

From MaRDI portal
Revision as of 08:04, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:609824

Available identifiers

zbMath Open volgenant.antonMaRDI QIDQ609824

List of research outcomes





PublicationDate of PublicationType
Symmetric traveling salesman problems2018-07-19Paper
On weighting two criteria with a parameter in combinatorial optimization problems2012-12-29Paper
Solving the rectangular assignment problem and applications2011-04-08Paper
On scheduling a single machine with resource dependent release times2010-12-01Paper
Improved polynomial algorithms for robust bottleneck problems with interval data2009-12-22Paper
Solving the 2-rooted mini-max spanning forest problem by branch-and-bound2009-12-07Paper
On a pair of job-machine assignment problems with two stages2009-10-15Paper
A heuristic for multiple-feeder PCB manufacturing2009-10-15Paper
Technical Note—A Note on Parametric Analysis in Linear Assignment2009-08-13Paper
An addendum on the incremental assignment problem2009-03-24Paper
Partial enumeration in heuristics for some combinatorial optimization problems2007-06-25Paper
A branch-and-bound algorithm for the singly constrained assignment problem2006-10-25Paper
Some inverse optimization problems under the Hamming distance2005-12-05Paper
An addendum on: ``Sensitivity analysis of the optimal assignment2005-10-17Paper
https://portal.mardi4nfdi.de/entity/Q31576452005-01-19Paper
On Steiner versions of (bi)connectivity in network problems2004-12-13Paper
Solving the \(k\)-cardinality assignment problem by transformation2004-08-16Paper
Improved heuristics for the traveling purchaser problem.2004-02-14Paper
Solving group Steiner problems as Steiner problems.2004-02-02Paper
A note on the assignment problem with seniority and job priority constraints.2004-02-02Paper
Linear assignment procedures2002-08-18Paper
Solving some lexicographic multi-objective combinatorial problems2002-05-28Paper
The dynamic predicate stashing copy problem and the Steiner problem in graphs2001-09-03Paper
A note on splitting of variables in integer programming models2000-03-23Paper
Improved heuristics for the \(n\)-job single-machine weighted tardiness problem1999-11-23Paper
The partial sum criterion for Steiner trees in graphs and shortest paths1999-02-22Paper
An addendum to the hierarchical network design problem1998-10-18Paper
Well-solved cases of the 2-peripatetic salesman problem1997-10-23Paper
Linear and semi-assignment problems: A core oriented approach1997-01-06Paper
The edge-disjoing steiner problem in graphs1996-09-18Paper
An addendum to the most vital edges of matching in a bipartite graph1996-08-05Paper
On the generalized 2-peripatetic salesman problem1994-07-26Paper
Minimum deviation and balanced optimization: A unified approach1991-01-01Paper
An Improved Heuristic for Multidimensional 0-1 Knapsack Problems1990-01-01Paper
An edge elimination test for the Steiner problem in graphs1989-01-01Paper
Reducing the hierarchical network design problem1989-01-01Paper
A Lagrangean approach to the degree-constrained minimum spanning tree problem1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34815171989-01-01Paper
Reduction tests for the steiner problem in grapsh1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42065681989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47336951989-01-01Paper
A shortest augmenting path algorithm for dense and sparse linear assignment problems1987-01-01Paper
Better assignment lower bounds for the Euclidean traveling salesman problem1987-01-01Paper
Some generalizations of the steiner problem in graphs1987-01-01Paper
A note on finding a shortest complete cycle in an undirected graph1986-01-01Paper
On dual solutions of the linear assignment problem1985-01-01Paper
Optimal Claiming in an Automobile Insurance System with Bonus-Malus Structure1985-01-01Paper
Improving Christofides' lower bound for the traveling salesman problem1985-01-01Paper
Solving symmetric vehicle routing problems asymmetrically1983-01-01Paper
Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem1980-01-01Paper

Research outcomes over time

This page was built for person: A. Volgenant