scientific article; zbMATH DE number 2107164
From MaRDI portal
Publication:4821303
zbMath1103.90003MaRDI QIDQ4821303
Ulrich Pferschy, Hans Kellerer, David Pisinger
Publication date: 12 October 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
heuristicsNP-completenessknapsack problemapproximation algorithmsexact algorithmsvariants and extensions
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (only showing first 100 items - show all)
Lagrangian matheuristics for the quadratic multiple knapsack problem ⋮ A lifted-space dynamic programming algorithm for the quadratic knapsack problem ⋮ The smoothed number of Pareto-optimal solutions in bicriteria integer optimization ⋮ Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties ⋮ An FPTAS for scheduling with resource constraints ⋮ Integer knapsack problems with profit functions of the same value range ⋮ Objective-based counterfactual explanations for linear discrete optimization ⋮ The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints ⋮ Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Loads scheduling for demand response in energy communities ⋮ Solving the 1-median problem on a network with continuous demand and demand surplus ⋮ R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines ⋮ The min-Knapsack problem with compactness constraints and applications in statistics ⋮ Prioritizing municipal lead mitigation projects as a relaxed knapsack optimization: a method and case study ⋮ Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties ⋮ A heuristic for the skiving and cutting stock problem in paper and plastic film industries ⋮ Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem ⋮ A mixed‐integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority ⋮ Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty ⋮ Ordinal optimization through multi-objective reformulation ⋮ Efficient emission reduction through dynamic supply mode selection ⋮ Lifting for the integer knapsack cover polyhedron ⋮ One-dimensional stock cutting resilient against singular random defects ⋮ Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items ⋮ Approximating single- and multi-objective nonlinear sum and product knapsack problems ⋮ Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints ⋮ A combinatorial flow-based formulation for temporal bin packing problems ⋮ Hybrid Ant Colony Optimization Algorithms—Behaviour Investigation Based on Intuitionistic Fuzzy Logic ⋮ A general purpose exact solution method for mixed integer concave minimization problems ⋮ Responsive strategic oscillation for solving the disjunctively constrained knapsack problem ⋮ Exponential extrapolation memory for tabu search ⋮ On computing probabilistic abductive explanations ⋮ Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method ⋮ The polyhedral-surface cutting plane method of optimization over a vertex-located set ⋮ Selecting a winner with external referees ⋮ Online TSP with known locations ⋮ STATIC STOCHASTIC KNAPSACK PROBLEMS ⋮ LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup ⋮ Intuitionistic fuzzy knapsack problem trough the index matrices prism ⋮ Routing Courier Delivery Services with Urgent Demand ⋮ Simple and fast algorithm for binary integer and online linear programming ⋮ A knapsack intersection hierarchy ⋮ Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems ⋮ Knapsack problems with position-dependent item weights or profits ⋮ An exact method for binary fortification games ⋮ Features for the 0-1 knapsack problem based on inclusionwise maximal solutions ⋮ Parallel batching with multi-size jobs and incompatible job families ⋮ More effort towards multiagent knapsack ⋮ Comparative analysis of linear programming relaxations for the robust knapsack problem ⋮ Budget-constrained cost-covering job assignment for a total contribution-maximizing platform ⋮ Stability and welfare in (dichotomous) hedonic diversity games ⋮ A decomposition approach for multidimensional knapsacks with family‐split penalties ⋮ Average behavior of greedy algorithms for the minimization knapsack problem: General coefficient distributions ⋮ Speedup estimates for some variants of the parallel implementations of the branch-and-bound method ⋮ On Bilevel Optimization with Inexact Follower ⋮ Quadratic Combinatorial Optimization Using Separable Underestimators ⋮ Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver ⋮ An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating ⋮ Greedy Heuristics and Weight-Coded EAs for Multidimensional Knapsack Problems and Multi-Unit Combinatorial Auctions ⋮ Dynamic Programming for an Optimal and Equitable Public Load Shedding Schedule ⋮ Improved Online Algorithms for Knapsack and GAP in the Random Order Model ⋮ A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem ⋮ Loop invariants ⋮ Precedence-constrained covering problems with multiplicity constraints ⋮ Analysis of Solution Quality of a Multiobjective Optimization-Based Evolutionary Algorithm for Knapsack Problem ⋮ Random knapsack in expected polynomial time ⋮ Lagrangian heuristics for the quadratic knapsack problem ⋮ A faster FPTAS for knapsack problem with cardinality constraint ⋮ Linear separation of connected dominating sets in graphs ⋮ A Genetic Algorithm for Optimization of a Relational Knapsack Problem with Respect to a Description Logic Knowledge Base ⋮ Optimal algorithms for selective variants of the classical and inverse median location problems on trees ⋮ Knapsack problems in groups ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Controlling selection areas of useful infeasible solutions for directed mating in evolutionary constrained multi-objective optimization ⋮ Budget-constrained minimum cost flows ⋮ The online knapsack problem with incremental capacity ⋮ Robust optimization approach for a chance-constrained binary knapsack problem ⋮ A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem ⋮ An adaptive stochastic knapsack problem ⋮ Matroid and knapsack center problems ⋮ Double system parts optimization: static and dynamic model ⋮ An efficient global algorithm for a class of indefinite separable quadratic programs ⋮ Decomposition based hybrid metaheuristics ⋮ Resource loading with time windows ⋮ Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems ⋮ An efficient algorithm for capacitated assortment planning with stochastic demand and substitution ⋮ Robust optimization of the 0-1 knapsack problem: balancing risk and return in assortment optimization ⋮ An exact decomposition algorithm for the generalized knapsack sharing problem ⋮ An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters ⋮ Asymptotic behavior of the quadratic knapsack problem ⋮ An implementation of exact knapsack separation ⋮ Exact solution of the robust knapsack problem ⋮ Generalized quadratic multiple knapsack problem and two solution approaches ⋮ Mathematical programming algorithms for bin packing problems with item fragmentation ⋮ Rapid calculation of exact cell bounds for contingency tables from conditional frequencies ⋮ The robust knapsack problem with queries ⋮ Fast machine reassignment
This page was built for publication:
