About strongly polynomial time algorithms for quadratic optimization over submodular constraints
From MaRDI portal
Recommendations
- A strongly polynomial time algorithm for a constrained submodular optimization problem
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A faster strongly polynomial time algorithm for submodular function minimization
- A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
Cited in
(40)- Inverse scheduling with maximum lateness objective
- Discrete convex analysis
- Quadratic resource allocation with generalized upper bounds
- The nonlinear knapsack problem - algorithms and applications
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- Quadratic M-convex and L-convex functions
- Resource allocation problems in decentralized energy management
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- Decreasing minimization on M-convex sets: background and structures
- Decreasing minimization on M-convex sets: algorithms and applications
- Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
- Maximize a monotone function with a generic submodularity ratio
- Deterministic approximation algorithm for submodular maximization subject to a matroid constraint
- A survey of scheduling with controllable processing times
- Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
- A survey on the continuous nonlinear resource allocation problem
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- Two-machine open shop problem with controllable processing times
- Complexity and algorithms for nonlinear optimization problems
- A fast algorithm for quadratic resource allocation problems with nested constraints
- A decomposition algorithm for nested resource allocation problems
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- Theory of principal partitions revisited
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- A survey on double greedy algorithms for maximizing non-monotone submodular functions
- Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs
- On a Reduction for a Class of Resource Allocation Problems
- Machine speed scaling by adapting methods for convex optimization with submodular constraints
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
- A strongly polynomial time algorithm for a constrained submodular optimization problem
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- Inverse scheduling: Two-machine flow-shop problem
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- The newsvendor problem with capacitated suppliers and quantity discounts
- A Newton's method for the continuous quadratic knapsack problem
- Variable fixing algorithms for the continuous quadratic Knapsack problem
This page was built for publication: About strongly polynomial time algorithms for quadratic optimization over submodular constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908017)
