Abstract The most important ingredient for solving mixed-integer nonlinear programs (MINLPs) to global $$\epsilon $$ ϵ -optimality with spatial branch and bound is a tight, computationally tractable relaxation. Due both theoretical practical considerations, relaxations of MINLPs are usually required be convex...

Covering problems are well-studied in the domain of Operations Research, and, more specifically, Location Science. When location space is a network, most frequent assumption to consider candidate facility locations, points be covered, or both, finite sets. In this work, we study set-covering problem when both locations and demand continuous on network. This variant has received little attention...

Cutting plane methods play a significant role in modern solvers for tackling mixed-integer programming (MIP) problems. Proper selection of cuts would remove infeasible solutions the early stage, thus largely reducing computational burden without hurting solution accuracy. However, major cut approaches heavily rely on heuristics, which strongly depend specific problem at hand and limit their gen...

1 A Novel Mixed Integer Programming Formulation for Selecting the Best Renewable Energies to Invest: A Fuzzy Goal Programming Approach Masoud Rabbani, School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran Mahsa Ghanbarpour Mamaghani, School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran Amir Farshbaf-Geranmayeh, Schoo...