Search Results - subject:"reformulation linearization technique"

A two-level location-allocation problem in designing local access fiber optic networks

Park, Gigyoung; Lee, Youngho; Han, Junghee - In: Computers & operations research : and their … 51 (2014), pp. 52-63

Persistent link: https://www.econbiz.de/10010408911

Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation

Rostami, Borzou; Malucelli, Federico - In: Computers & operations research : and their … 64 (2015), pp. 178-188

Persistent link: https://www.econbiz.de/10011373442

Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality

Dalkiran, Evrim; Sherali, Hanif - In: Journal of Global Optimization 57 (2013) 4, pp. 1147-1172

In this paper, we propose two sets of theoretically filtered bound-factor constraints for constructing reformulation-linearization … technique (RLT)-based linear programming (LP) relaxations for solving polynomial programming problems. We establish related …

Persistent link: https://www.econbiz.de/10010896447

A lifted compact formulation for the daily aircraft maintenance routing problem

Haouari, Mohamed; Shao, Shengzhi; Sherali, Hanif D. - In: Transportation science : a journal of the Institute for … 47 (2013) 4, pp. 508-525

Persistent link: https://www.econbiz.de/10010227195

An integrated approach for airline flight selection and timing, fleet assignment, and aircraft routing

Sherali, Hanif D.; Bae, Ki-hwan; Haouari, Mohamed - In: Transportation science : a journal of the Institute for … 47 (2013) 4, pp. 455-476

Persistent link: https://www.econbiz.de/10010227215

The coastal seaspace patrol sector design and allocation problem

Lunday, Brian; Sherali, Hanif; Lunday, Kevin - In: Computational Management Science 9 (2012) 4, pp. 483-514

on Steiner tree problem (STP) constructs and enhanced by the reformulation-linearization technique (RLT) yielded the best …

Persistent link: https://www.econbiz.de/10010846137

Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts

Sherali, Hanif; Dalkiran, Evrim; Desai, Jitamitra - In: Computational Optimization and Applications 52 (2012) 2, pp. 483-506

Persistent link: https://www.econbiz.de/10010847455

Branch and cut algorithms for detecting critical nodes in undirected graphs

Summa, Marco Di; Grosso, Andrea; Locatelli, Marco - In: Computational Optimization and Applications 53 (2012) 3, pp. 649-680

In this paper we deal with the critical node problem, where a given number of nodes has to be removed from an undirected graph in order to maximize the disconnections between the node pairs of the graph. We propose an integer linear programming model with a non-polynomial number of constraints...

Persistent link: https://www.econbiz.de/10010998318

Reduced RLT representations for nonconvex polynomial programming problems

Sherali, Hanif; Dalkiran, Evrim; Liberti, Leo - In: Journal of Global Optimization 52 (2012) 3, pp. 447-469

Persistent link: https://www.econbiz.de/10010539285

Dynamic Lagrangian dual and reduced RLT constructs for solving 0–1 mixed-integer programs

Sherali, Hanif; Smith, J. - In: TOP: An Official Journal of the Spanish Society of … 20 (2012) 1, pp. 173-189

Persistent link: https://www.econbiz.de/10010557938