Minmax combinatorial optimization

90C27: Combinatorial optimization

Related Items

Heuristic scheduling of parallel machines with sequence-dependent set-up times, Generalized Bottleneck Problems^∗

Cites Work

A greedy heuristic for 3-partitioning with similar elements
Ratio combinatorial programs
Traveling salesman problem under categorization
Minimum perfect bipartite matchings and spanning trees under categorization
Solving makespan minimization problems with Lagrangean decomposition
A technique for speeding up the solution of the Lagrangean dual
Bottleneck assignment problems under categorization
A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
A dual ascent approach for steiner tree problems on a directed graph
An Operation Partitioning Problem for Automated Assembly System Design
Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems
Resource-Constrained Assignment Scheduling
Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
Bicriteria Transportation Problem
An integer linear programming approach to the steiner problem in graphs
Selecting Subsets from the Set of Nondominated Vectors in Multiple Objective Linear Programming
Some Generalisations of the Time Minimising Assignment Problem
Categorized Assignment Scheduling: a Tabu Search Approach
On a new solution concept for bargaining problems
An interactive weighted Tchebycheff procedure for multiple objective programming
Validation of subgradient optimization
Bottleneck extrema
The traveling-salesman problem and minimum spanning trees: Part II