Minmax combinatorial optimization
From MaRDI portal
Publication:1130081
DOI10.1016/0377-2217(93)E0325-RzbMath0906.90150OpenAlexW2082019790MaRDI QIDQ1130081
Yash P. Aneja, Abraham P. Punnen
Publication date: 16 August 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0325-r
Lagrangean relaxationsubgradient optimizationexact and heuristic methodsminmax combinatorial optimization
Related Items
The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis ⋮ Generalized Bottleneck Problems∗ ⋮ Exact algorithms for OWA-optimization in multiobjective spanning tree problems ⋮ Heuristic scheduling of parallel machines with sequence-dependent set-up times
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
