Pages that link to "Item:Q1824562"
From MaRDI portal
The following pages link to Solving combinatorial problems with combined min-max-min-sum objective and applications (Q1824562):
Displaying 26 items.
- Generalized multiple objective bottleneck problems (Q453049) (← links)
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm (Q486731) (← links)
- On the generality of the greedy algorithm for solving matroid base problems (Q496445) (← links)
- Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector (Q723499) (← links)
- Minimum deviation and balanced optimization: A unified approach (Q806674) (← links)
- k-sum optimization problems (Q916568) (← links)
- On \(k\)-Max-optimization (Q1002079) (← links)
- Minmax combinatorial optimization (Q1130081) (← links)
- An \(O(m\log n)\) algorithm for the max+sum spanning tree problem (Q1266709) (← links)
- The stochastic bottleneck linear programming problem (Q1304778) (← links)
- On combined minmax-minsum optimization (Q1333027) (← links)
- A bilevel bottleneck programming problem (Q1390218) (← links)
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector (Q1685587) (← links)
- The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases (Q1755782) (← links)
- Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization (Q1761116) (← links)
- Note on combinatorial optimization with max-linear objective functions (Q1803670) (← links)
- Multiple bottleneck assignment problem (Q1806893) (← links)
- On ranking of feasible solutions of a bottleneck linear programming problem (Q1919119) (← links)
- On weighting two criteria with a parameter in combinatorial optimization problems (Q1926813) (← links)
- Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs (Q2032145) (← links)
- Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector (Q2089873) (← links)
- (Q3330973) (← links)
- Combining Minsum And Minmax: A Goal Programming Approach (Q3634991) (← links)
- A Survey on Multiple Objective Minimum Spanning Tree Problems (Q3637314) (← links)
- The Newton sums method in combinatorial optimization (Q4712351) (← links)
- On bilevel fractional programming (Q4859832) (← links)
