Deakin University
Browse

File(s) under permanent embargo

A quick practical guide to polyhedral analysis in integer programming

conference contribution
posted on 2017-01-01, 00:00 authored by Vicky MakVicky Mak
Polyhedral analysis is one of the most interesting elements of integer programming and has been often overlooked. It plays an important role in finding exact
solutions to an integer program. In this paper, we will discuss what polyhedral analysis is, and how some constraints for an integer programming model are “ideal” in the
sense that if the model contains all of these “ideal” constraints, then the integer optimal solution can be obtained by simply solving a linear programming relaxation of
the integer program. This paper serves as a quick guide for young researchers and
PhD students

History

Event

Data and Decision Sciences in Action. Conference (2016 : Canberra, Australian Capital Territory)

Series

Lecture Notes in Management and Industrial Engineering

Pagination

175 - 185

Publisher

Springer

Location

Canberra, Australian Capital Territory

Place of publication

Cham, Switzerland

Start date

2016-11-16

End date

2016-11-17

ISSN

2198-0772

ISBN-13

978-3-319-55913-1

Language

eng

Publication classification

E Conference publication; E1 Full written paper - refereed

Editor/Contributor(s)

R Sarker, H Abbass, S Dunstall, P Kilby, R Davis, L Young

Title of proceedings

ASOR 2016 : Proceedings of the Australian Society for Operations Research Conference 2016