0-1 Mixed-Integer Bilinear Covering Sets에 대한 Lifted Bilinear Cover Inequalities의 Separation

정광헌 2019년

논문상세정보

인용/피인용

논문영향력 요약
동일주제 총논문수	논문피인용 총횟수	주제별 논문영향력의 평균
주제	Bilinear inequality Cut-and-Branch Separation lifting mixedintegerprogramming(mip)
135	0	0.0%

논문영향력
주제		주제별 논문수	주제별 논문영향력
주제어	Bilinear inequality	3	0.0%
	Cut-and-Branch	2	0.0%
	Separation	107	0.0%
	lifting	17	0.0%
	mixedintegerprogramming(mip)	6	0.0%
계		135	0.0%
* 다른 주제어 보유 논문에서 피인용된 횟수

고정비용 0-1 배낭문제에 대한 크바탈-고모리 부등식의 분리문제에 관한 연구
박경철 [2011]
Valid Inequalities and Super-additivity for 0-1 Integer Programs
Wolsey, L.A. [1977]
Strong Valid Inequalities for Orthogonal Disjunctions and Bilinear Covering Sets
Tawarmalani, M. [2010]
Sequence Independent Lifting in Mixed-Integer Programming
Gu, Z. [2000]
Lifting 기법을 이용한 Generalized Bilinear Cover Inequality
정광헌 [2017]
Lifting Inequalities : A Framework for Generating Strong Cuts for Nonlinear Programs
Richard, J.P.P. [2010]
Lifted Inequalities for 0-1 Mixed-Integer Bilinear Covering Sets
Chung, K. [2014]
Lifted Cover Inequalities for 0-1 Integer Programs : Computation
Gu, Z. [1998]
Integer and Combinatorial Optimization
Nemhauser, G. L [1988]
Facets and Strong Valid Inequalities for Integer Programs
Wolsey, L.A. [1976]
Computational Study of Cutting Planes for a Lot-Sizing Problem in Branch-and-Cut Algorithm
정광헌 [2015]
Computability of Global Solutions to Factorable Nonconvex Programs : Part I-Convex Underestimating Problems
McCormick, G.P. [1976]
Branching and Bounds Tightening Techniques for Non-Convex MINLP
Belotti, P. [2009]
An Algorithm for Separable Nonconvex Programming Problems
Falk, J.E. [1969]