Take Action
Home | Faculty & Research Overview | Research
Research Details
The Partition Problem, Mathematical Programming
Abstract
In this paper we describe several forms of thek-partition problem and give integer programming formulations of each case. The dimension of the associated polytopes and some basic facets are identified. We also give several valid and facet defining inequalities for each of the polytopes.
Type
Article
Author(s)
Sunil Chopra, M. R. Rao
Date Published
1993
Citations
Chopra, Sunil, and M. R. Rao. 1993. The Partition Problem. Mathematical Programming.(1): 87-115.
KELLOGG INSIGHT
Explore leading research and ideas
Find articles, podcast episodes, and videos that spark ideas in lifelong learners, and inspire those looking to advance in their careers.
learn more
COURSE CATALOG
Review Courses & Schedules
Access information about specific courses and their schedules by viewing the interactive course scheduler tool.
LEARN MORE
DEGREE PROGRAMS
Discover the path to your goals
Whether you choose our Full-Time, Part-Time or Executive MBA program, you’ll enjoy the same unparalleled education, exceptional faculty and distinctive culture.
learn more