Minmax combinatorial optimization
From MaRDI portal
Recommendations
Cites work
- A dual ascent approach for steiner tree problems on a directed graph
- A greedy heuristic for 3-partitioning with similar elements
- A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
- A technique for speeding up the solution of the Lagrangean dual
- An integer linear programming approach to the steiner problem in graphs
- An interactive weighted Tchebycheff procedure for multiple objective programming
- An Operation Partitioning Problem for Automated Assembly System Design
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Bicriteria Transportation Problem
- Bottleneck assignment problems under categorization
- Bottleneck extrema
- Categorized Assignment Scheduling: a Tabu Search Approach
- Minimum perfect bipartite matchings and spanning trees under categorization
- On a new solution concept for bargaining problems
- Ratio combinatorial programs
- Resource-Constrained Assignment Scheduling
- Selecting Subsets from the Set of Nondominated Vectors in Multiple Objective Linear Programming
- Solving makespan minimization problems with Lagrangean decomposition
- Some Generalisations of the Time Minimising Assignment Problem
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The traveling-salesman problem and minimum spanning trees: Part II
- Traveling salesman problem under categorization
- Validation of subgradient optimization
- Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems
Cited in
(18)- Min-max optimization of several classical discrete optimization problems
- On combined minmax-minsum optimization
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- Solving combinatorial problems with combined min-max-min-sum objective and applications
- scientific article; zbMATH DE number 3862930 (Why is no real title available?)
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
- Solution of combinatorial optimization problems with minimax criterion
- scientific article; zbMATH DE number 4127012 (Why is no real title available?)
- Problèmes de minimax partiel
- Heuristic scheduling of parallel machines with sequence-dependent set-up times
- Computing near-optimal solutions for the dominating subset with minimal weight problem
- Generalized Bottleneck Problems∗
- scientific article; zbMATH DE number 895365 (Why is no real title available?)
- scientific article; zbMATH DE number 895371 (Why is no real title available?)
- scientific article; zbMATH DE number 912372 (Why is no real title available?)
- Min-max-min robust combinatorial optimization
- scientific article; zbMATH DE number 969179 (Why is no real title available?)
- Computational approaches to a combinatorial optimization problem arising from text classification
This page was built for publication: Minmax combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1130081)
