Pages that link to "Item:Q1908017"

The following pages link to About strongly polynomial time algorithms for quadratic optimization over submodular constraints (Q1908017):

Displaying 39 items.

• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
• Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs (Q492813) (← links)
• Fast algorithm for singly linearly constrained quadratic programs with box-like constraints (Q513719) (← links)
• A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
• Inverse scheduling: Two-machine flow-shop problem (Q640308) (← links)
• Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
• The newsvendor problem with capacitated suppliers and quantity discounts (Q724067) (← links)
• A Newton's method for the continuous quadratic knapsack problem (Q892383) (← links)
• Variable fixing algorithms for the continuous quadratic Knapsack problem (Q927220) (← links)
• Inverse scheduling with maximum lateness objective (Q1041341) (← links)
• Discrete convex analysis (Q1290668) (← links)
• Quadratic resource allocation with generalized upper bounds (Q1376263) (← links)
• The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
• Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
• Quadratic M-convex and L-convex functions (Q1883382) (← links)
• Resource allocation problems in decentralized energy management (Q2014593) (← links)
• Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
• Decreasing minimization on M-convex sets: background and structures (Q2089794) (← links)
• Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
• Decreasing minimization on base-polyhedra: relation between discrete and continuous cases (Q2111551) (← links)
• Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost (Q2174270) (← links)
• A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function (Q2202007) (← links)
• Maximize a monotone function with a generic submodularity ratio (Q2220848) (← links)
• Deterministic approximation algorithm for submodular maximization subject to a matroid constraint (Q2235731) (← links)
• A survey of scheduling with controllable processing times (Q2381529) (← links)
• Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance (Q2434334) (← links)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
• Breakpoint searching algorithms for the continuous quadratic knapsack problem (Q2465658) (← links)
• Two-machine open shop problem with controllable processing times (Q2467128) (← links)
• Complexity and algorithms for nonlinear optimization problems (Q2480263) (← 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)
• Theory of Principal Partitions Revisited (Q2971607) (← links)
• A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions (Q3297828) (← links)
• On a Reduction for a Class of Resource Allocation Problems (Q5087712) (← links)
• Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints (Q5131701) (← links)
• An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (Q5270754) (← links)