Pages that link to "Item:Q1977259"

The following pages link to Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem (Q1977259):

Displaying 17 items.

• Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209) (← links)
• Improved algorithms for single machine scheduling with release dates and rejections (Q262445) (← links)
• Online removable knapsack with limited cuts (Q410717) (← links)
• Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem (Q835755) (← links)
• Online minimization knapsack problem (Q897874) (← links)
• Nonconvex piecewise linear knapsack problems (Q948649) (← links)
• Single-machine scheduling under the job rejection constraint (Q964407) (← links)
• Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs (Q2069234) (← links)
• Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations (Q2398648) (← links)
• Online removable knapsack problem under convex function (Q2453163) (← links)
• Algorithms for solving the single-sink fixed-charge transportation problem (Q2462557) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• Algorithms with guarantee value for knapsack problems (Q2903135) (← links)
• ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES (Q2998841) (← links)
• 2D Knapsack: Packing Squares (Q3004667) (← links)
• Bandwidth Constrained Multi-interface Networks (Q3075517) (← links)
• Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)