scientific article

From MaRDI portal
Publication:3988807

zbMath0741.90048MaRDI QIDQ3988807

J. B. G. Frenk, Martine Labbé, János A. Csirik, Shu-Zhong Zhang

Publication date: 28 June 1992


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Scheduling a single machine with parallel batching to minimize makespan and total rejection costAnalysis of some greedy algorithms for the single-sink fixed-charge transportation problemOptimizing the half-product and related quadratic Boolean functions: approximation and scheduling applicationsAnalysis of bounds for a capacitated single-item lot-sizing problemSolving the 1-median problem on a network with continuous demand and demand surplusThe min-Knapsack problem with compactness constraints and applications in statisticsA quality assuring, cost optimal multi-armed bandit mechanism for expertsourcingOnline removable knapsack with limited cutsApproximating single- and multi-objective nonlinear sum and product knapsack problemsOnline minimization knapsack problemOn improved interval cover mechanisms for crowdsourcing marketsGreedy algorithms for the single-demand facility location problemOnline removable knapsack problem under convex functionAlgorithms for solving the single-sink fixed-charge transportation problem2D Knapsack: Packing SquaresSupermodular covering knapsack polytopeA study on the optimal inventory allocation for clinical trial supply chainsApproximation schemes for \(r\)-weighted minimization knapsack problemsEasy knapsacks and the complexity of energy allocation problems in the smart gridThe continuous knapsack problem with capacitiesStage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programsFast approximation schemes for Boolean programming and scheduling problems related to positive convex half-productImproved algorithms for single machine scheduling with release dates and rejections