Solving resource allocation problems in disaster management using linear programming relaxations
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3121293 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- scientific article; zbMATH DE number 3185974 (Why is no real title available?)
- An Automatic Method of Solving Discrete Programming Problems
- An interior point method and Sherman-Morrison formula for solving large scale convex quadratic problems with diagonal Hessians
- Edmonds polytopes and a hierarchy of combinatorial problems
- Finding Groups in Data
- Integer Programming and the Theory of Grouping
- Location science
- Location-allocation planning of stockpiles for effective disaster mitigation
- Outline of an algorithm for integer solutions to linear programs
- Personnel scheduling and supplies provisioning in emergency relief operations
- Revival of the Gomory cuts in the 1990's
- Worst-Case and Probabilistic Analysis of a Geometric Location Problem
This page was built for publication: Solving resource allocation problems in disaster management using linear programming relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7000867)
