Reference health
Generation of the exact Pareto set in Multi-Objective Traveling Salesman and Set Covering Problems
43/43 checkable references clean · checked 2026-07-22
Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.
23 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.
The 43 checked references that resolve
resolves10.1007/s002910000046
A survey and annotated bibliography of multiobjective combinatorial optimization
resolves10.1016/j.amc.2013.03.002
An improved version of the augmented ε-constraint method (AUGMECON2) for finding the exact pareto set in multi-objective integer programming problems
resolves10.1007/978-3-642-11218-8_6
The Multiobjective Traveling Salesman Problem: A Survey and a New Approach
resolves10.1080/02331938208842786
Solving a multiobjective traveling salesman problem by dynamic programming
resolves10.1023/A:1009690717521
Use of Substitute Scalarizing Functions to Guide a Local Search Based Heuristic: The Case of moTSP
resolves10.1016/S0377-2217(01)00104-7
Genetic local search for multi-objective combinatorial optimization
resolves10.1007/3-540-36970-8_34
A Two-Phase Local Search for the Biobjective Traveling Salesman Problem
resolves10.1016/j.cor.2008.11.013
Design and analysis of stochastic local search for the multiobjective traveling salesman problem
resolves10.1007/s10732-009-9103-9
Two-phase Pareto local search for the biobjective traveling salesman problem
resolves10.1016/j.ejor.2007.10.054
Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
resolves10.1007/978-3-540-88051-6_14
Comparison between MOEA/D and NSGA-II on the Multi-Objective Travelling Salesman Problem
resolves10.1016/j.cie.2008.01.005
A memetic random-key genetic algorithm for a symmetric multi-objective traveling salesman problem
resolves10.1016/j.ejor.2006.03.041
A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP
resolves10.1007/s00500-011-0759-3
Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems
resolves10.1007/s10732-011-9181-3
On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
resolves10.15837/ijccc.2008.4.2405
Computation Results of Finding All Efficient Points in Multiobjective Combinatorial Optimization
resolves10.1016/j.ejor.2007.12.014
An exact -constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits
resolves10.1007/s10852-008-9080-2
Multi-objective Meta-heuristics for the Traveling Salesman Problem with Profits
resolves10.1007/s00453-007-9011-z
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
resolves10.1016/0377-2217(92)90138-Y
The traveling salesman problem: An overview of exact and approximate algorithms
resolves10.1016/j.amc.2004.09.091
A method for generating all efficient solutions of 0-1 multi-objective linear programming problem
resolves10.1016/j.amc.2005.01.038
Multi-criteria branch and bound: A vector maximization algorithm for Mixed 0-1 Multiple Objective Linear Programming
resolves10.1016/j.amc.2012.09.043
An integrated multi-objective framework for solving multi-period project selection problems
resolves10.1023/B:ANOR.0000039516.50069.5b
A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm
resolves10.1007/s10479-006-0060-5
Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem
resolves10.1016/j.amc.2009.03.037
Effective implementation of the ε-constraint method in Multi-Objective Mathematical Programming problems
resolves10.1016/j.ejor.2004.08.029
An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
resolves10.1023/A:1008258310679
Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem
resolves10.1016/j.disopt.2010.03.005
A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
resolves10.1016/S0377-2217(99)00284-2
An effective implementation of the Lin–Kernighan traveling salesman heuristic
resolves10.1007/s10957-013-0364-y
Multi-Objective Integer Programming: An Improved Recursive Algorithm
resolves10.1287/mnsc.1100.1248
An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
resolves10.1016/j.cor.2005.09.014
Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
resolves10.1016/j.cor.2012.02.021
An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
The 23 references without a DOI — listed, not checked
no DOI — not checked10.1016/j.amc.2014.03.110_b0005
no DOI — not checked10.1016/j.amc.2014.03.110_b0010
no DOI — not checked10.1016/j.amc.2014.03.110_b0020
no DOI — not checkedP.C. Borges, M.P. Hansen, A basis for future successes in multiobjective combinatorial optimization, Technical Report, Institute of Mathematical Modelling, Technical University of Denmark, 1998.
no DOI — not checkedAn analysis of algorithmic components for multiobjective ant colony optimization: a case study on the biobjective TSP
no DOI — not checkedStochastic local search algorithms for multiobjective combinatorial optimization: methods and analysis
no DOI — not checkedT. Lust, New metaheuristics for solving MOCO problems: application to the knapsack problem, the traveling salesman problem and IMRT optimization (Ph.D. thesis), Université de Mons, Mons, Belgium, 2009.
no DOI — not checkedOn the solution of travelling salesman problems
no DOI — not checkedVery large-scale neighborhood search for solving multiobjective combinatorial optimization problems
no DOI — not checked10.1016/j.amc.2014.03.110_b0205
no DOI — not checked10.1016/j.amc.2014.03.110_b0215
no DOI — not checkedM.R. Bussieck, Introduction to GAMS branch-and-cut facility, Technical report, GAMS Development Corp., 2003. <http://www.gams.com/docs/bch.htm>.
no DOI — not checkedGAMS Corp., Traveling salesman problem with BCH, <http://www.gams.com/modlib/libhtml/bchtsp.htm>.
no DOI — not checkedM.R. Bussieck, Column generation in GAMS – Extending the GAMS branch-and-cut-and-heuristic (BCH) facility, in: 83rd Working Group Meeting Real World Optimization, Workshop “Mathematical Optimization in Transportation – Airline, Public, Transport, Railway” GOR, Bad Honnef, Germany, 2009. Available online at: <http://www.gams.com/presentations/bussieck_cg.pdf>.
no DOI — not checkedG. Reinelt, TSPLIB95, URL: <http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/>.
no DOI — not checkedA. Brooke, D. Kendrick, A. Meeraus, R. Raman, GAMS. A user’s guide, GAMS development corporation, Washington, 1998.
no DOI — not checked<https://sites.google.com/site/thibautlust/research/multiobjective-tsp> (last accessed on July 24th 2013).
no DOI — not checked<http://eden.dei.uc.pt/~paquete/tsp> (last accessed on July 22nd 2013).
no DOI — not checked<http://xgandibleux.free.fr/MOCOlib/MOSCP.html> (last accessed on July 29th 2013).
no DOI — not checked10.1016/j.amc.2014.03.110_b0270
no DOI — not checkedPerformance scaling of multi-objective evolutionary algorithms
no DOI — not checked10.1016/j.amc.2014.03.110_b0295
no DOI — not checkedD. Applegate, R. Bixby, V. Chvátal, W. Cook, Concorde TSP solver <http://www.tsp.gatech.edu/concorde.html>.
What this badge says. CiteStamped means the CHECKABLE references of this
work were clean at the dated check: each resolved to a known work in a public registry, and none
carried a retraction notice at that time. It says nothing about the quality, findings,
or importance of the work itself, and nothing about references deposited without a DOI.
checked 2026-07-22 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record
Embed this badge
Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.
<a href="https://citestamp.com/citestamped/10.1016/j.amc.2014.03.110"><img src="https://citestamp.com/citestamped/10.1016/j.amc.2014.03.110/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[](https://citestamp.com/citestamped/10.1016/j.amc.2014.03.110)