Adjacency of the 0-1 knapsack problem
type: Item
instance of: scholarly article
title: Adjacency of the 0-1 knapsack problem
zbMATH Open document ID: 0758.90059
DOI: 10.1016/0305-0548(92)90019-2
author: Daniel Geist
author: E. Y. Rodin
published in: Computers \& Operations Research
publication date: 1992-10-05T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 52B12
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 69044
zbMATH Keywords: adjacency
zbMATH Keywords: 0-1 knapsack polytope
zbMATH Keywords: NP-complete
MaRDI profile type: Publication
full work available at URL: 0305-0548(92)90019-2
OpenAlex ID: W2017122944
cites work: Facets of the knapsack polytope
cites work: Facets of the Knapsack Polytope From Minimal Covers
cites work: On certain polytopes associated with graphs
cites work: Q4198056
cites work: Facet of regular 0–1 polytopes
cites work: The complexity of lifted inequalities for the knapsack problem
cites work: Q3882177
cites work: Computing Partitions with Applications to the Knapsack Problem
cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm
cites work: A New Algorithm for the 0-1 Knapsack Problem
cites work: Heuristic algorithms for the multiple knapsack problem
cites work: The adjacency relation on the traveling salesman polytope is NP-Complete
cites work: Q3682240
cites work: Adjacency of the Traveling Salesman Tours and $0 - 1$ Vertices
cites work: Faces for a linear inequality in 0–1 variables
cites work: Easily Computable Facets of the Knapsack Polytope
description: scientific article; zbMATH DE number 69044