On weighting two criteria with a parameter in combinatorial optimization problems
From MaRDI portal
Publication:1926813
DOI10.1016/j.ejor.2012.01.054zbMath1253.90204OpenAlexW2039579076MaRDI QIDQ1926813
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.01.054
Related Items
A geometric characterisation of the quadratic min-power centre, A bi-objective modeling approach applied to an urban semi-desirable facility location problem
Cites Work
- Finding the upper envelope of n line segments in O(n log n) time
- Balanced optimization problems
- The Min-Max Spanning Tree Problem and some extensions
- An \(O(m\log n)\) algorithm for the max+sum spanning tree problem
- A variation of the assignment problem
- Combining linear and nonlinear objectives in spanning tree problems
- Solving combinatorial problems with combined min-max-min-sum objective and applications
- A data structure for dynamic trees
- Proportionate flowshops with general position-dependent processing times
- Constrained balanced optimization problems
- An algorithm for minimizing flow time and maximum earliness on a single machine
- An Algorithm for Minimizing the Range of Lateness on a Single Machine
- Minimizing the Range of Lateness on a Single Machine
- Assignment Problems
- Improved Bounds for the Range of Lateness on a Single Machine
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- The constrained minimax linear assignment problem
- Fibonacci heaps and their uses in improved network optimization algorithms
- Multicriteria Optimization
