On Merging Cover Inequalities for Multiple Knapsack Problems

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Open Journal of Optimization

ISSN Print: 2325-7105
ISSN Online: 2325-7091
www.scirp.org/journal/ojop
E-mail: ojop@scirp.org

Citations h5-index & Ranking*

Journals Menu

"On Merging Cover Inequalities for Multiple Knapsack Problems"
written by Randal Hickman, Todd Easton,
published by Open Journal of Optimization, Vol.4 No.4, 2015

has been cited by the following article(s):

Google Scholar
CrossRef

[1]	A very fast method for guaranteed generation of one facet for 0-1 knapsack polyhedron
	Scientia Iranica, 2022

[2]	Approximate and exact merging of knapsack constraints with cover inequalities
	2020

[3]	Knapsack polytopes: a survey
	2019

[4]	Octanary Polyhedral Branch and Bound for Integer Programs
	Int. J. Operational Research, 2019

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Free SCIRP Newsletters

Add your e-mail address to receive free newsletters from SCIRP.

Top

Open Journal of Optimization

Open Journal of Optimization

Journals Menu

Home

About SCIRP

Service

Policies

[1]	Approximate and exact merging of knapsack constraints with cover inequalities Optimization, 2020 DOI:10.1080/02331934.2020.1719492

[2]	Knapsack polytopes: a survey Annals of Operations Research, 2019 DOI:10.1007/s10479-019-03380-2