Warm-start routines for solving augmented weighted Tchebycheff network programs in multiple-objective network programming

DOI10.1287/IJOC.1050.0140zbMATH Open1241.90165DBLPjournals/informs/Sun05OpenAlexW2151776118WikidataQ57570761 ScholiaQ57570761MaRDI QIDQ2892259

Minghe Sun

Publication date: 18 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1050.0140

zbMATH Keywords

multiple-criteria decision makinginteractive proceduresflow algorithmsmultiple-objective programminginitial solutionnetwork-flow problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29)

Related Items (3)

A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems ⋮ Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs ⋮ Finding integer efficient solutions for multiple objective network programming problems

This page was built for publication: Warm-start routines for solving augmented weighted Tchebycheff network programs in multiple-objective network programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892259)