scientific article; zbMATH DE number 33203

MaRDI QIDQ3988807zbMATH OpenFDO

Authors J. B. G. Frenk, Martine Labbé, János Csirik, Shuzhong Zhang

Publication date 28 June 1992

zbMATH Keywords

worst-case boundgreedy-type heuristic0-1 min-knapsack

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Boolean programming (90C09)

Recommendations

• An extension of a greedy heuristic for the knapsack problem
• A procedure-based heuristic for 0-1 multiple knapsack problems
• A New Algorithm for the 0-1 Knapsack Problem
• A Minimal Algorithm for the 0-1 Knapsack Problem
• Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem

Cited in

(29)

• Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
• Greedy algorithms for the single-demand facility location problem
• Improved algorithms for single machine scheduling with release dates and rejections
• Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
• Learning to sample initial solution for solving 0-1 discrete optimization problem by local search
• A Minimal Algorithm for the 0-1 Knapsack Problem
• Algorithms for solving the single-sink fixed-charge transportation problem
• 2D knapsack: packing squares
• Analysis of bounds for a capacitated single-item lot-sizing problem
• On improved interval cover mechanisms for crowdsourcing markets
• Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem
• A study on the optimal inventory allocation for clinical trial supply chains
• Approximating single- and multi-objective nonlinear sum and product knapsack problems
• Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs
• A heuristic solution procedure for the multiconstraint zero-one knapsack problem
• A quality assuring, cost optimal multi-armed bandit mechanism for expertsourcing
• Analysis of divide-and-conquer strategies for the 0-1 minimization knapsack problem
• The min-Knapsack problem with compactness constraints and applications in statistics
• Online minimization knapsack problem
• Online removable knapsack problem under convex function
• Easy knapsacks and the complexity of energy allocation problems in the smart grid
• The continuous knapsack problem with capacities
• Minimizing the maximum lateness for scheduling with release times and job rejection
• Approximation schemes for \(r\)-weighted minimization knapsack problems
• A total-value greedy heuristic for the integer knapsack problem
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
• Supermodular covering knapsack polytope
• Online removable knapsack with limited cuts
• Solving the 1-median problem on a network with continuous demand and demand surplus

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988807)