Simple Lifted Cover Inequalities and Hard Knapsack Problems

Discrete Optimization - Netherlands
doi 10.1016/j.disopt.2005.06.003
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Hard Tiling Problems With Simple Tiles

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2001English

Higher-Order Cover Cuts From Zero–one Knapsack Constraints Augmented by Two-Sided Bounding Inequalities

Discrete Optimization
Computational TheoryApplied MathematicsTheoretical Computer ScienceMathematics
2008English

Simple Truths, Hard Problems: Some Thoughts on Terror, Justice, and Self-Defence

Philosophy
Philosophy
2005English

Improved Approximation Results for Stochastic Knapsack Problems

2011English

Solution of “Hard” Knapsack Instances Using Quantum Inspired Evolutionary Algorithm

International Journal of Applied Evolutionary Computation
2014English

Knapsack Problems: A Parameterized Point of View

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

Tolerance Analysis for 0–1 Knapsack Problems

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2017English

Simple Norm Inequalities

American Mathematical Monthly
Mathematics
2006English

N-Step Mingling Inequalities: New Facets for the Mixed-Integer Knapsack Set

Mathematical Programming, Series B
MathematicsSoftware
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy