On combined minmax-minsum optimization
From MaRDI portal
Recommendations
- Combining Minsum And Minmax: A Goal Programming Approach
- Minmax combinatorial optimization
- scientific article; zbMATH DE number 912372
- Solving combinatorial problems with combined min-max-min-sum objective and applications
- scientific article; zbMATH DE number 3862930
- scientific article; zbMATH DE number 895368
- On the solution of min-sum-min problems
- Min-max-min robust combinatorial optimization
- scientific article; zbMATH DE number 1524443
- On \(k\)-sum optimization
Cites work
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
- A linear time algorithm for the maximum capacity path problem
- Algorithms for the minimax transportation problem
- Minimax linear programming problem
- Minimum deviation problems
- Minmax linear programmes with grouped variables
- On the solution of discrete bottleneck problems
- Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation
- Parametric analysis of linear programs with upper bounded variables
- Solving combinatorial problems with combined min-max-min-sum objective and applications
- The Constrained Bottleneck Problem in Networks
- The Min-Max Spanning Tree Problem and some extensions
- The auction algorithm: A distributed relaxation method for the assignment problem
Cited in
(16)- scientific article; zbMATH DE number 3862930 (Why is no real title available?)
- Inverse max+sum spanning tree problem under weighted l₁ norm by modifying the sum-cost vector
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
- Quadratic bottleneck knapsack problems
- Multiple bottleneck assignment problem
- Combining Minsum And Minmax: A Goal Programming Approach
- The balanced traveling salesman problem
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
- Solution of combinatorial optimization problems with minimax criterion
- An O(m n) algorithm for the max+sum spanning tree problem
- Solving combinatorial problems with combined min-max-min-sum objective and applications
- On the generality of the greedy algorithm for solving matroid base problems
- Constrained balanced optimization problems
- A Survey on Multiple Objective Minimum Spanning Tree Problems
- Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector
- The quadratic balanced optimization problem
This page was built for publication: On combined minmax-minsum optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333027)
