Pages that link to "Item:Q3988807"

The following pages link to Heuristics for the 0-1 min-knapsack problem (Q3988807):

Displaying 31 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)
• Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826) (← links)
• Online removable knapsack with limited cuts (Q410717) (← links)
• Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem (Q835755) (← links)
• Analysis of bounds for a capacitated single-item lot-sizing problem (Q858280) (← links)
• Online minimization knapsack problem (Q897874) (← links)
• An extension of a greedy heuristic for the knapsack problem (Q1178644) (← links)
• A total-value greedy heuristic for the integer knapsack problem (Q1200766) (← links)
• A quality assuring, cost optimal multi-armed bandit mechanism for expertsourcing (Q1690964) (← links)
• Greedy algorithms for the single-demand facility location problem (Q1728306) (← links)
• Supermodular covering knapsack polytope (Q1751131) (← links)
• Easy knapsacks and the complexity of energy allocation problems in the smart grid (Q1800444) (← links)
• Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem (Q1977259) (← links)
• The continuous knapsack problem with capacities (Q2059181) (← links)
• Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs (Q2069234) (← links)
• Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem (Q2185833) (← links)
• A study on the optimal inventory allocation for clinical trial supply chains (Q2247342) (← links)
• Approximation schemes for \(r\)-weighted minimization knapsack problems (Q2288864) (← 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)
• 2D Knapsack: Packing Squares (Q3004667) (← links)
• A heuristic solution procedure for the multiconstraint zero-one knapsack problem (Q3750525) (← links)
• A Minimal Algorithm for the 0-1 Knapsack Problem (Q4393123) (← links)
• Solving the 1-median problem on a network with continuous demand and demand surplus (Q6068730) (← links)
• The min-Knapsack problem with compactness constraints and applications in statistics (Q6069243) (← links)
• Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)
• On improved interval cover mechanisms for crowdsourcing markets (Q6164503) (← links)
• Learning to sample initial solution for solving 0-1 discrete optimization problem by local search (Q6564766) (← links)
• Minimizing the maximum lateness for scheduling with release times and job rejection (Q6646743) (← links)