An alternate approach to solve two-level priority based assignment problem
From MaRDI portal
Publication:2114824
DOI10.1007/S10589-021-00340-0zbMATH Open1487.90576OpenAlexW4205458917MaRDI QIDQ2114824FDOQ2114824
Authors: Fanrong Xie, Zuo An Li, Anuj Kumar Sharma 
Publication date: 15 March 2022
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-021-00340-0
Recommendations
- A priority based assignment problem
- On two competing mechanisms for priority-based allocation problems
- On an algorithm solving two-level programming problems with nonunique lower level solutions
- Two phase algorithms for the bi-objective assignment problem
- scientific article; zbMATH DE number 2112451
- A two-stage approach to solving large capacitated task allocation problems
- A dual approach to multi-dimensional assignment problems
- A ranking method for the assignment problem with multiple optimal solutions
- An improved algorithm for two stage time minimization assignment problem
- A population-based algorithm for solving linear assignment problems with two objectives
iterative algorithmcombinatorial optimizationassignment problemmaximum flownetwork with lower and upper arc capacities
Cites Work
- Network flows. Theory, algorithms, and applications.
- Benchmarking optimization software with performance profiles.
- Title not available (Why is that?)
- The generalized assignment problem with minimum quantities
- A dual approach for solving the combined distribution and assignment problem with link capacity constraints
- Title not available (Why is that?)
- Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
- A strongly polynomial minimum cost circulation algorithm
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
- Lexicographic bottleneck problems
- An algorithm for the bottleneck generalized assignment problem
- A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem
- An improved algorithm for two stage time minimization assignment problem
- A min max problem
- A goal programming approach for a multi-objective multi-choice assignment problem
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm
- Algorithm for the solution of the bottleneck assignment problem
- A branch‐and‐price approach for the stochastic generalized assignment problem
- A Combinatorial Algorithm
- Solution methods and computational investigations for the linear bottleneck assignment problem
- Title not available (Why is that?)
- Alternate strategies for solving bottleneck assignment problems - analysis and computational results
- On the bottleneck assignment problem
- An Iterative Solution Technique to Minimize the Average Transportation Cost of Capacitated Transportation Problem with Bounds on Rim Conditions
- A priority based unbalanced time minimization assignment problem
- A priority based assignment problem
- On the complexity of project scheduling to minimize exposed time
Cited In (2)
This page was built for publication: An alternate approach to solve two-level priority based assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114824)
