Solving large-scale weapon target assignment problems in seconds using branch-price-and-cut

DOI10.1002/NAV.22249MaRDI QIDQ6949622zbMATH OpenFDO

Authors Dimitris Bertsimas, Alex Paskov

Publication date 1 August 2025

Published in Naval Research Logistics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1002/NAV.22249

zbMATH Keywords

assignment problemsbranch-price-and-cutcolumn generationinteger optimizationnonlinear optimization

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Discrete location and assignment (90B80) Integer programming (90C10) Combinatorial optimization (90C27)

Cites work

• A general model and efficient algorithms for reliable facility location problem under uncertain disruptions
• A mathematical immunochemoradiotherapy model: a multiobjective approach
• A target-assignment problem
• An algorithm for the bottleneck generalized assignment problem
• Assignment problems: a golden anniversary survey
• Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems
• Branch-and-price: Column generation for solving huge integer programs
• Coordinate descent algorithms
• Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem
• scientific article; zbMATH DE number 3067835 (Why is no real title available?)
• Nonlinear assignment problems. Algorithms and applications
• On Optimum Target Assignments
• Optimizing the marriage market: an application of the linear assignment model
• Set Partitioning: A survey
• The weapon-target assignment problem
• Weapon-target assignment problem: exact and approximate solution algorithms

This page was built for publication: Solving large-scale weapon target assignment problems in seconds using branch-price-and-cut

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6949622)