A Decomposition Algorithm for Nested Resource Allocation Problems
From MaRDI portal
Publication:2810553
DOI10.1137/140965119zbMath1347.90068arXiv1404.6694OpenAlexW2127223974MaRDI QIDQ2810553
Patrick Jaillet, Thibaut Vidal, Nelson F. Maculan
Publication date: 3 June 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.6694
resource allocationlot sizingseparable convex optimizationspeed optimizationnested constraintsproject crashing
Convex programming (90C25) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Convex functions and convex programs in convex geometry (52A41) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items
Algorithms for separable convex optimization with linear ascending constraints, A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints, On a Reduction for a Class of Resource Allocation Problems, A fast algorithm for quadratic resource allocation problems with nested constraints, Solving nested-constraint resource allocation problems with an interior point method, Resource allocation problems in decentralized energy management
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for a separable integer programming problem with cumulatively bounded variables
- An O(n) algorithm for quadratic knapsack problems
- The vehicle routing problem with flexible time windows and traveling times
- Random convex hulls and extreme value statistics
- A linear-time algorithm for a special case of disjoint set union
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
- On implementing a primal-dual interior-point method for conic quadratic optimization
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- On solving convex optimization problems with linear ascending constraints
- PERT and crashing revisited: Mathematical generalizations
- A survey on the continuous nonlinear resource allocation problem
- A Few Remarks on the Assortment Problem
- A Network Flow Computation for Project Cost Curves
- Analysis of an exact algorithm for the vessel speed optimization problem
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- Separable Convex Optimization Problems with Linear Ascending Constraints
- Decentralized Resource Allocation in Dynamic Networks of Agents
- The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
- Efficient Algorithms for a Selection Problem with Nested Constraints and Its Application to a Production-Sales Planning Model
- Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
- Efficiency of a Good But Not Linear Set Union Algorithm
- A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
- Application of a Technique for Research and Development Program Evaluation
- Determination of Optimal Capacities of Service for Facilities with a Linear Measure of Inefficiency
- On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem
- A Problem in Optimum Allocation
- A Combinatorial Lemma for Complex Numbers
- Convex separable optimization is not much harder than linear optimization
- The Theory of Dynamic Programming as Applied to a Smoothing Problem
- Production Planning Over Time and the Nature of the Expectation and Planning Horizon
