Multi-dimensional vector assignment problems
DOI10.1016/J.DISOPT.2014.08.005zbMATH Open1308.90088OpenAlexW2106754332MaRDI QIDQ2339839FDOQ2339839
Authors: Trivikram Dokka, Frits C. R. Spieksma, Yves Crama 
Publication date: 9 April 2015
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2014.08.005
Recommendations
- Approximability and exact resolution of the multidimensional binary vector assignment problem
- Multidimensional binary vector assignment problem: standard, structural and above guarantee parameterizations
- Approximability and exact resolution of the multidimensional binary vector assignment problem
- Multidimensional binary vector assignment problem: standard, structural and above guarantee parameterizations
- scientific article; zbMATH DE number 1947414
submodularityworst-case analysisapproximabilitymulti-dimensional assignmentwafer-to-wafer integration
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Approximation algorithms for multi-dimensional assignment problems with decomposable costs
- Assignment Problems
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- The design of approximation algorithms
- The hardness of approximation: Gap location
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Geometric three-dimensional assignment problems
- Three-dimensional axial assignment problems with decomposable cost coefficients
- Max-algebra: The linear algebra of combinatorics?
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximating the multi-level bottleneck assignment problem
- Submodular Approximation: Sampling-based Algorithms and Lower Bounds
- Multi-dimensional vector assignment problems
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
- Between a rock and a hard place: the two-to-one assignment problem
- Approximation algorithms for the wafer to wafer integration problem
Cited In (14)
- Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm
- Vector assignment problems: a general framework
- Balanced Optimization with Vector Costs
- Approximability and exact resolution of the multidimensional binary vector assignment problem
- On the complexity of wafer-to-wafer integration
- On the complexity of wafer-to-wafer integration
- Multi-dimensional vector assignment problems
- Approximation algorithms for the wafer to wafer integration problem
- Approximability and exact resolution of the multidimensional binary vector assignment problem
- Multidimensional binary vector assignment problem: standard, structural and above guarantee parameterizations
- Vector assignment schemes for asymmetric settings
- Robust balanced optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Multi-dimensional vector assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339839)
