Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The worst case analysis of strong knapsack facets

From MaRDI portal
Publication:517314
Jump to:navigation, search

DOI10.1007/s10107-016-1050-2zbMath1358.90079OpenAlexW2461421350MaRDI QIDQ517314

Sunil Chopra, Wenwei Cao, Sang Ho Shim

Publication date: 23 March 2017

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-016-1050-2



Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)


Related Items (3)

Knapsack polytopes: a survey ⋮ A concise characterization of strong knapsack facets ⋮ A few strong knapsack facets



Cites Work

  • Corner polyhedra and their connection with cutting planes
  • T-space and cutting planes
  • Cyclic group and knapsack facets
  • Worst-case comparison of valid inequalities for the TSP
  • Cyclic group blocking polyhedra
  • A 3-slope theorem for the infinite relaxation in the plane
  • Binary group facets with complete support and non-binary coefficients
  • Some polyhedra related to combinatorial problems
  • A $(k+1)$-Slope Theorem for the $k$-Dimensional Infinite Group Relaxation
  • A few strong knapsack facets
  • Some continuous functions related to corner polyhedra
  • Some continuous functions related to corner polyhedra, II


This page was built for publication: The worst case analysis of strong knapsack facets

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:517314&oldid=12402711"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 07:25.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki