• Home
  • Search
  • An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
  • Cite Icon89
  • https://doi.org/10.1287/mnsc.1100.1248Copy DOI Icon

An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In this paper, we present an exact algorithm to find all extreme supported nondominated points of multiobjective mixed integer programs. The algorithm uses a composite linear objective function and finds all the desired points in a finite number of steps by changing the weights of the objective functions in a systematic way. We develop further variations of the algorithm to improve its computational performance and demonstrate our algorithm's performance on multiobjective assignment, knapsack, and traveling salesperson problems with three and four objectives.

Similar Papers
  • Research Article
  • Citations1

Regression Test Case Selection for MultiObjective Optimization Using Metaheuristics

  • Mar 08, 2015
  • International Journal of Information Technology and Computer Science
  • Rahul Chaudhary +1
  • PDF
  • Research Article
  • Citations3

Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation

  • Dec 02, 2021
  • Central European Journal of Operations Research
  • A Herraiz +2
  • Research Article

Management Insights

  • Dec 01, 2010
  • Management Science
  • Michael F Gorman
  • Book Chapter
  • Citations2

Evaluation of Traveling Salesman Problem Instance Hardness by Clustering

  • Sep 24, 2017
  • Pavel Krömer +1
  • Research Article
  • Citations54

Selection of algorithms to solve traveling salesman problems using meta-learning1

  • Jun 17, 2011
  • International Journal of Hybrid Intelligent Systems
  • Jorge Kanda +3
  • Book Chapter
  • Citations5

Approximation Algorithms for Multi-criteria Traveling Salesman Problems

  • Jan 01, 2007
  • Bodo Manthey +1
  • Book Chapter
  • Citations13

Universal Conditions for Algebraic Traveling Salesman Problems to be Efficiently Solvable

  • Jan 01, 1992
  • R. E. Burkard +1
  • PDF
  • Research Article
  • Citations2

Exact and Heuristic Algorithms for Routing AGV on Path with Precedence Constraints

  • Jan 01, 2016
  • Mathematical Problems in Engineering
  • Liang Xu +3
  • Research Article
  • Citations35

A Critical Review of Multi-hole Drilling Path Optimization

  • Jan 22, 2018
  • Archives of Computational Methods in Engineering
  • Reginald Dewil +3
  • Conference Article
  • Citations32

Cost effective mobile agent planning for distributed information retrieval

  • Apr 16, 2001
  • Jin-Wook Baek +3
  • Research Article
  • Citations410

Routing for Relief Efforts

  • May 01, 2008
  • Transportation Science
  • Ann Melissa Campbell +2
  • Conference Article
  • Citations18

An ETH-Tight Exact Algorithm for Euclidean TSP

  • Oct 01, 2018
  • Mark De Berg +3
  • Book Chapter
  • Citations2

Metaheuristics Approaches for the Travelling Salesman Problem on a Spherical Surface

  • Oct 01, 2020
  • Yusuf Sahin +4
  • Book Chapter
  • Citations1

Traveling Salesman Problems and Extensions

  • Jan 01, 2000
  • H. A. Eiselt +1
  • Research Article

Ant Colony Optimization Algorithms with Multiple Simulated Colonies Offer Potential Advantages for Solving the Traveling Salesman Problem and, by Extension, Other Optimization Problems

  • Jan 01, 2015
  • Journal of Emerging Investigators
  • M Evan Wildenhain +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.