Numerical analysis of tricriteria tree and assignment problems

MaRDI QIDQ1571283zbMATH OpenFDO

Authors I. I. Melamed, I. Kh. Sigal

Publication date 18 February 2004

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

treenumerical analysismulticriteria optimizationsolution algorithmdiscrete programmingAssignment problems

Mathematics Subject Classification ID

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

Recommendations

• Numerical analysis of algorithms for solving bicriteria discrete programming problems
• scientific article; zbMATH DE number 4059134
• scientific article; zbMATH DE number 4102829
• scientific article; zbMATH DE number 4055390
• Tree decomposition and discrete optimization problems: a survey
• Applying numerical trees to evaluate asymmetric decision problems
• Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem
• Treatment of combinatorial optimization problems using selection equations with cost terms. II: NP-hard three-dimensional assignment problems
• Bicriteria assignment problems: Complexity estimates and solution algorithms
• A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems

Cited in

(5)

• Combinatorial optimization problems with two and three criteria
• Generalized multiple objective bottleneck problems
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• Threshold robustness in discrete facility location problems: a bi-objective approach
• A Survey on Multiple Objective Minimum Spanning Tree Problems

This page was built for publication: Numerical analysis of tricriteria tree and assignment problems

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