Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
From MaRDI portal
Publication:4302594
DOI10.1287/moor.19.2.390zbMath0820.90082OpenAlexW1989262026MaRDI QIDQ4302594
Publication date: 14 September 1995
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/875b96b857c61172820c15889f6dc17984dbbb14
strongly polynomial algorithmsallocation problemalgebraic tree computation modelscaling-based algorithms
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30)
Related Items (41)
Maximum likelihood estimation of cell probabilities in constrained multinomial models ⋮ Algorithms for separable convex optimization with linear ascending constraints ⋮ Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems ⋮ Decision model and analysis for investment interest expense deduction and allocation ⋮ Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems ⋮ Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS ⋮ A nonlinear knapsack problem ⋮ Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling ⋮ A short proof of optimality of the bottom up algorithm for discrete resource allocation problems ⋮ M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System ⋮ 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 ⋮ Equivalence of convex minimization problems over base polytopes ⋮ Minimization of an M-convex function ⋮ A stochastic game framework for patrolling a border ⋮ A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems ⋮ A heuristic algorithm for a chance constrained stochastic program ⋮ Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization ⋮ Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. ⋮ A polynomial algorithm for resourse allocation problems with polymatroid constrains1 ⋮ A unified method for a class of convex separable nonlinear knapsack problems ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM ⋮ Graver basis and proximity techniques for block-structured separable convex integer minimization problems ⋮ Complexity and algorithms for nonlinear optimization problems ⋮ Coordinatewise domain scaling algorithm for M-convex function minimization ⋮ A capacity scaling algorithm for M-convex submodular flow ⋮ On speed scaling via integer programming ⋮ A Greedy Algorithm for Capacitated Lot-Sizing Problems ⋮ Minimum entropy orientations ⋮ A Decomposition Algorithm for Nested Resource Allocation Problems ⋮ A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives ⋮ Optimal binary trees with order constraints ⋮ Discrete convex analysis ⋮ Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations ⋮ The nonlinear knapsack problem - algorithms and applications ⋮ Decreasing minimization on base-polyhedra: relation between discrete and continuous cases ⋮ On solving convex optimization problems with linear ascending constraints ⋮ The discrete forward-reserve problem -- allocating space, selecting products, and area sizing in forward order picking
This page was built for publication: Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
