Pages that link to "Item:Q4302594"
From MaRDI portal
The following pages link to Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems (Q4302594):
Displaying 42 items.
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- A unified method for a class of convex separable nonlinear knapsack problems (Q930930) (← links)
- Optimal binary trees with order constraints (Q1283811) (← links)
- Discrete convex analysis (Q1290668) (← links)
- A short proof of optimality of the bottom up algorithm for discrete resource allocation problems (Q1373462) (← links)
- Minimization of an M-convex function (Q1392577) (← links)
- Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization (Q1410696) (← links)
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. (Q1421475) (← links)
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
- The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
- Algorithms for separable convex optimization with linear ascending constraints (Q1628287) (← links)
- Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling (Q1663138) (← links)
- Coordinatewise domain scaling algorithm for M-convex function minimization (Q1771308) (← links)
- A capacity scaling algorithm for M-convex submodular flow (Q1777220) (← links)
- On speed scaling via integer programming (Q1785426) (← links)
- A nonlinear knapsack problem (Q1905070) (← links)
- Equivalence of convex minimization problems over base polytopes (Q1926652) (← links)
- Decreasing minimization on base-polyhedra: relation between discrete and continuous cases (Q2111551) (← links)
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems (Q2248743) (← links)
- On solving convex optimization problems with linear ascending constraints (Q2355310) (← links)
- The discrete forward-reserve problem -- allocating space, selecting products, and area sizing in forward order picking (Q2355889) (← links)
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems (Q2371518) (← links)
- Decision model and analysis for investment interest expense deduction and allocation (Q2379558) (← links)
- A heuristic algorithm for a chance constrained stochastic program (Q2432880) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- Minimum entropy orientations (Q2517793) (← links)
- A fast algorithm for quadratic resource allocation problems with nested constraints (Q2669547) (← links)
- A Decomposition Algorithm for Nested Resource Allocation Problems (Q2810553) (← links)
- A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives (Q2817799) (← links)
- Maximum likelihood estimation of cell probabilities in constrained multinomial models (Q4253300) (← links)
- A Greedy Algorithm for Capacitated Lot-Sizing Problems (Q4430673) (← links)
- A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems (Q4602345) (← links)
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM (Q4649881) (← links)
- PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS (Q4818570) (← links)
- Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems (Q5058035) (← links)
- M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System (Q5085152) (← links)
- A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints (Q5085487) (← links)
- On a Reduction for a Class of Resource Allocation Problems (Q5087712) (← links)
- A polynomial algorithm for resourse allocation problems with polymatroid constrains<sup>1</sup> (Q5689829) (← links)
- A stochastic game framework for patrolling a border (Q6096639) (← links)
- Separation in distributionally robust monopolist problem (Q6609172) (← links)
