Take Action
Home | Faculty & Research Overview | Research
Research Details
On Ternary Problems, Mathematical Programming
Abstract
We consider ternary matrices, i.e., integer matrices having all entries 0, 1 or 2. Three associated problems the group problem, covering, and packing are studied. General classes of vertices and facets are discussed in each case. Certain lifting procedures are also described. For all three problems techniques used are natural extensions of those used in the binary case.
Type
Article
Author(s)
Date Published
1989
Citations
Chopra, Sunil. 1989. On Ternary Problems. Mathematical Programming.(1-3): 35-47.
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