Multi-dimensional vector assignment problems

DOI10.1016/J.DISOPT.2014.08.005MaRDI QIDQ2339839zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

submodularityworst-case analysisapproximabilitymulti-dimensional assignmentwafer-to-wafer integration

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• Approximability and exact resolution of the multidimensional binary vector assignment problem
• Approximability and exact resolution of the multidimensional binary vector assignment problem
• scientific article; zbMATH DE number 1947414

Cites work

• scientific article; zbMATH DE number 2126322 (Why is no real title available?)
• scientific article; zbMATH DE number 1894374 (Why is no real title available?)
• Approximating the multi-level bottleneck assignment problem
• Approximation algorithms for multi-dimensional assignment problems with decomposable costs
• Approximation algorithms for the wafer to wafer integration problem
• Approximation algorithms for three-dimensional assignment problems with triangle inequalities
• Assignment Problems
• Between a rock and a hard place: the two-to-one assignment problem
• Geometric three-dimensional assignment problems
• Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
• Max-algebra: The linear algebra of combinatorics?
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Multi-dimensional vector assignment problems
• Submodular Approximation: Sampling-based Algorithms and Lower Bounds
• The design of approximation algorithms
• The hardness of approximation: Gap location
• Three-dimensional axial assignment problems with decomposable cost coefficients

Cited in

(13)

• 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
• Multi-dimensional vector assignment problems
• On the complexity of wafer-to-wafer integration
• Approximation algorithms for the wafer to wafer integration problem
• Approximability and exact resolution of the multidimensional binary vector assignment problem
• Vector assignment schemes for asymmetric settings
• Robust balanced optimization
• scientific article; zbMATH DE number 1310285 (Why is no real title available?)
• scientific article; zbMATH DE number 1947414 (Why is no real title available?)

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)