Two-set inequalities for the binary knapsack polyhedra
type: Item
instance of: scholarly article
title: Two-set inequalities for the binary knapsack polyhedra
author: T. Easton
author: Jennifer Tryon
author: Fabio Vitor
published in: Discrete Optimization
publication date: 2025-01-23T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7974133
zbMATH Keywords: integer programming
zbMATH Keywords: knapsack problem
zbMATH Keywords: lifting
zbMATH Keywords: synchronized simultaneous lifting
zbMATH Keywords: cutting planes
MaRDI profile type: Publication
cites work: Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms
cites work: Reducibility among Combinatorial Problems
cites work: Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
cites work: A multi-level search strategy for the 0-1 multidimensional knapsack problem
cites work: Approximate and exact merging of knapsack constraints with cover inequalities
cites work: Q4943600
cites work: A fuzzy DEA and knapsack formulation integrated model for project selection
cites work: A global optimization approach for solving three-dimensional open dimension rectangular packing problems
cites work: Production and inventory management under multiple resource constraints
cites work: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
cites work: A Knapsack Secretary Problem with Applications
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
cites work: Q4859954
cites work: Knapsack polytopes: a survey
cites work: Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
cites work: A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
cites work: Separation algorithms for 0-1 knapsack polytopes
cites work: Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
cites work: Simple lifted cover inequalities and hard knapsack problems
cites work: Merging valid inequalities over the multiple knapsack polyhedron
cites work: On tightening cover induced inequalities
cites work: Technical Note—Facets and Strong Valid Inequalities for Integer Programs
cites work: Sequence independent lifting in mixed integer programming
cites work: Some polyhedra related to combinatorial problems
cites work: Faces for a linear inequality in 0–1 variables
cites work: Technical Note—A Note on Zero-One Programming
cites work: Facets of the knapsack polytope
cites work: Facets of the Knapsack Polytope From Minimal Covers
cites work: Easily Computable Facets of the Knapsack Polytope
cites work: On lifted cover inequalities: a new lifting procedure with unusual properties
cites work: On the complexity of sequentially lifting cover inequalities for the knapsack polytope
cites work: Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
cites work: Lifting the facets of zero–one polytopes
cites work: Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
cites work: Cutting planes in integer and mixed integer programming
DOI: 10.1016/J.DISOPT.2024.100859
description: scientific article; zbMATH DE number 7974133