Integer programming models for the multidimensional assignment problem with star costs
From MaRDI portal
Publication:2256320
DOI10.1016/j.ejor.2013.10.048zbMath1305.90263OpenAlexW1963699305MaRDI QIDQ2256320
Jose L. Walteros, Chrysafis Vogiatzis, Panos M. Pardalos, Eduardo L. Pasiliao
Publication date: 19 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.10.048
combinatorial optimizationgraph partitioningbranch and pricemultidimensional assignment problemstar coveringmulti-sensor multi-target tracking problem
Integer programming (90C10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Efficient sensor network management for asset localization, Task assignment in tree-like hierarchical structures, Detecting critical node structures on graphs: A mathematical programming approach, Dynamic discrete tomography, A novel convex dual approach to three-dimensional assignment problem: theoretical analysis, A dual approach to multi-dimensional assignment problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- On an exact method for the constrained shortest path problem
- Local search heuristics for the multidimensional assignment problem
- Selected topics on assignment problems
- Asymptotic properties of random multidimensional assignment problems
- Assignment problems: a golden anniversary survey
- Asymptotic behavior of the expected optimal value of the multidimensional assignment problem
- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
- Clique facets of the axial and planar assignment polytopes
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
- Approximation algorithms for multi-dimensional assignment problems with decomposable costs
- A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
- Nonlinear assignment problems. Algorithms and applications
- Test problem generator for the multidimensional assignment problem
- Multiple bottleneck assignment problem
- Tracking elementary particles near their primary vertex: A combinatorial approach
- Randomized parallel algorithms for the multidimensional assignment problem
- Three-dimensional axial assignment problems with decomposable cost coefficients
- Bees algorithm for generalized assignment problem
- Facets of the three-index assignment polytope
- Interior point stabilization for column generation
- On multi-index assignment polytopes
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- GRASP with Path Relinking for Three-Index Assignment
- Branch and bound solution of the multidimensional assignment problem formulation of data association
- Cutting planes for branch-and-price algorithms
- APPLYING SIMULATED ANNEALING TO THE MULTIDIMENSIONAL ASSIGNMENT PROBLEM
- Reducibility Among Combinatorial Problems
- The three dimensional bottleneck assignment problem and its variants
- An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
- An Algorithm for the Three-Index Assignment Problem
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Application of 0-1 integer programming to multitarget tracking problems
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Local search heuristics for multi-index assignment problems with decomposable costs
- A set‐partitioning‐based exact algorithm for the vehicle routing problem
- Branch and bound algorithms for the multidimensional assignment problem
- Selected Topics in Column Generation
- Shortest Path Problems with Resource Constraints
- Letter to the Editor—The Multidimensional Assignment Problem
- A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem
