Pages that link to "Item:Q5753748"

The following pages link to Convex separable optimization is not much harder than linear optimization (Q5753748):

Displaying 50 items.

• A multi-stage stochastic programming approach in master production scheduling (Q421590) (← links)
• Efficient methods for selfish network design (Q442104) (← links)
• Selfish splittable flows and NP-completeness (Q465681) (← links)
• Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
• Slack allocation algorithm for parallel machines (Q666009) (← links)
• Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305) (← links)
• The nestedness property of the convex ordered median location problem on a tree (Q783030) (← links)
• Tightness of sensitivity and proximity bounds for integer linear programs (Q831833) (← links)
• Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms (Q865749) (← links)
• Global optimization for first order Markov random fields with submodular priors (Q967400) (← links)
• Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
• New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems (Q1038094) (← links)
• Exact and approximate algorithms for high-multiplicity parallel machine scheduling (Q1041349) (← links)
• Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
• A polynomial algorithm for an integer quadratic non-separable transportation problem (Q1198737) (← links)
• Design of manufacturing systems using queueing models (Q1205352) (← links)
• On polynomial solvability of the high multiplicity total weighted tardiness problem (Q1208472) (← links)
• Optimizing flow rates in a queueing network with side constraints (Q1266636) (← links)
• The empirical performance of a polynomial algorithm for constrained nonlinear optimization (Q1309871) (← links)
• A capacity scaling algorithm for convex cost submodular flows (Q1363412) (← links)
• Bounds for global optimization of capacity expansion and flow assignment problems (Q1591547) (← links)
• Scheduling for electricity cost in a smart grid (Q1702731) (← links)
• Quadratic M-convex and L-convex functions (Q1883382) (← links)
• A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (Q1897348) (← links)
• Refined proximity and sensitivity results in linearly constrained convex separable integer programming (Q1899421) (← links)
• A nonlinear knapsack problem (Q1905070) (← links)
• A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables (Q1919095) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• Streaming graph computations with a helpful advisor (Q1939657) (← links)
• Analysis of a joint pricing and seat allocation model in a hub-to-hub airline network (Q2014046) (← links)
• A unified approach for a 1D generalized total variation problem (Q2149555) (← links)
• Proximity in concave integer quadratic programming (Q2149572) (← links)
• The complexity of vector partition (Q2155634) (← links)
• Improving the Cook et al. proximity bound given integral valued constraints (Q2164682) (← links)
• Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
• Computation and efficiency of potential function minimizers of combinatorial congestion games (Q2235157) (← links)
• Graver basis and proximity techniques for block-structured separable convex integer minimization problems (Q2248743) (← links)
• Distances between optimal solutions of mixed-integer programs (Q2288201) (← links)
• Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
• A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611) (← links)
• Scaling, proximity, and optimization of integrally convex functions (Q2414902) (← links)
• Balancing of agricultural census data by using discrete optimization (Q2448220) (← links)
• Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
• Vector and matrix apportionment problems and separable convex integer optimization (Q2482690) (← links)
• Maximum network flows with concave gains (Q2492702) (← links)
• When is rounding allowed in integer nonlinear optimization? (Q2514870) (← links)
• Optimal preemptive scheduling for general target functions (Q2581760) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• Ameso optimization: a relaxation of discrete midpoint convexity (Q2659175) (← links)
• Approximate separable multichoice optimization over monotone systems (Q2673246) (← links)