scientific article; zbMATH DE number 1894378
From MaRDI portal
Publication:4801577
zbMATH Open1134.90434MaRDI QIDQ4801577FDOQ4801577
Authors: Liqun Qi, Defeng Sun 
Publication date: 8 April 2003
Title of this publication is not available (Why is that?)
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Cited In (17)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A hybrid genetic algorithm for the three-index assignment problem
- Nonnegative tensors revisited: plane stochastic tensors
- On solvability of the axial 8-index assignment problem on single-cycle permutations
- Title not available (Why is that?)
- The simplest families of polytopes associated with NP-hard problems
- Linear-time separation algorithms for the three-index assignment polytope
- A full description of polytopes related to the index of the lowest nonzero row of an assignment matrix
- Fast separation algorithms for three-index assignment problems
- On multi-index assignment polytopes
- Heuristic strategies for combining solutions of the three-index axial assignment problem
- Facets of the axial three-index assignment polytope
- Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem
- Fast separation for the three-index assignment problem
- Title not available (Why is that?)
- Investigation of polynomial algorithms for solving the three-index planar assignment problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4801577)
