scientific article; zbMATH DE number 1302173
From MaRDI portal
Publication:4247440
zbMath0924.90120MaRDI QIDQ4247440
Publication date: 16 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial optimization (90C27) Boolean programming (90C09) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
An optimization algorithm for the clearing of interbank payments, A new class of hard problem instances for the 0-1 knapsack problem, Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems, Rapid calculation of exact cell bounds for contingency tables from conditional frequencies, Multiattribute electronic procurement using goal programming, Multiple-choice knapsack constraint in graphical models, FACTORIZATION LENGTH DISTRIBUTION FOR AFFINE SEMIGROUPS III: MODULAR EQUIDISTRIBUTION FOR NUMERICAL SEMIGROUPS WITH ARBITRARILY MANY GENERATORS, Computing knapsack solutions with cardinality robustness, Knapsack problems: a parameterized point of view, Features for the 0-1 knapsack problem based on inclusionwise maximal solutions, Submodularity-based false data injection attack scheme in multi-agent dynamical systems, Elasticity in Apéry Sets, Average performance of greedy heuristics for the integer knapsack problem., Factorization length distribution for affine semigroups. II: Asymptotic behavior for numerical semigroups with arbitrarily many generators, Global optimality conditions and optimization methods for quadratic knapsack problems, Nonconvex piecewise linear knapsack problems, Discrete location problems with push-pull objectives, An exact algorithm for the knapsack sharing problem, Two-group knapsack game, Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis, An exact algorithm for the subset sum problem, Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem, Random knapsack in expected polynomial time, Lagrangian heuristics for the quadratic knapsack problem, Knapsack, A successive approximation algorithm for the multiple knapsack problem, Approximation algorithms for knapsack problems with cardinality constraints, Knapsack problems with setups, A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems, Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem, Cooperative and axiomatic approaches to the knapsack allocation problem
