BROWSE

Related Scientist

Dabeen, Lee's photo.

Dabeen, Lee
이산수학 그룹
more info

ITEM VIEW & DOWNLOAD

On a generalization of the Chvátal–Gomory closure

Cited 0 time in webofscience Cited 0 time in scopus
34 Viewed 0 Downloaded
Title
On a generalization of the Chvátal–Gomory closure
Author(s)
Dash, Sanjeeb; Günlük, Oktay; Dabeen Lee
Publication Date
2022-03
Journal
MATHEMATICAL PROGRAMMING, v.192, no.1-2, pp.149 - 175
Publisher
Springer Science and Business Media Deutschland GmbH
Abstract
© 2021, Springer-Verlag GmbH Germany, part of Springer Nature and Mathematical Optimization Society.Many practical integer programming problems involve variables with one or two-sided bounds. Dunkel and Schulz (A refined Gomory–Chvátal closure for polytopes in the unit cube, http://www.optimization-online.org/DB_FILE/2012/03/3404.pdf, 2012) considered a strengthened version of Chvátal–Gomory (CG) inequalities that use 0–1 bounds on variables, and showed that the set of points in a rational polytope that satisfy all these strengthened inequalities is a polytope. Recently, we generalized this result by considering strengthened CG inequalities that use all variable bounds. In this paper, we generalize further by considering not just variable bounds, but general linear constraints on variables. We show that all points in a rational polyhedron that satisfy such strengthened CG inequalities form a rational polyhedron. We also extend this polyhedrality result to mixed-integer sets defined by linear constraints.
URI
https://pr.ibs.re.kr/handle/8788114/11360
DOI
10.1007/s10107-021-01697-0
ISSN
0025-5610
Appears in Collections:
Pioneer Research Center for Mathematical and Computational Sciences(수리 및 계산과학 연구단) > Discrete Mathematics Group(이산 수학 그룹) > 1. Journal Papers (저널논문)
Files in This Item:
There are no files associated with this item.

qrcode

  • facebook

    twitter

  • Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
해당 아이템을 이메일로 공유하기 원하시면 인증을 거치시기 바랍니다.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse