Balanced Optimization with Vector Costs

DOI10.1007/978-3-319-51741-4_8zbMath1484.68067OpenAlexW2288369265MaRDI QIDQ2971159

Frits C. R. Spieksma, Gerhard J. Woeginger, Annette M. C. Ficker

Publication date: 4 April 2017

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-51741-4_8

zbMATH Keywords

computational complexityapproximationassignment problembalanced optimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• The balanced traveling salesman problem
• Balanced optimization problems
• Most and least uniform spanning trees
• On finding most uniform spanning trees
• The balanced linear programming problem
• Exact algorithms for the equitable traveling salesman problem
• Multi-dimensional vector assignment problems
• Efficient algorithms for minimum range cut problems
• Balanced paths in acyclic networks: Tractable cases and related approaches

This page was built for publication: Balanced Optimization with Vector Costs