Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Sujeevraja Sanjeevi"'
Publikováno v:
EURO Journal on Transportation and Logistics, Vol 11, Iss , Pp 100070- (2022)
This paper formulates a team orienteering problem with multiple fixed-wing drones and develops a branch-and-price algorithm to solve the problem to optimality. Fixed-wing drones, unlike rotary drones, have kinematic constraints associated with them,
Externí odkaz:
https://doaj.org/article/b2d613f3e7db4a528ea824dd9ed1f6ee
Given a nonlinear, univariate, bounded, and differentiable function $f(x)$, this article develops a sequence of Mixed Integer Linear Programming (MILP) and Linear Programming (LP) relaxations that converge to the graph of $f(x)$ and its convex hull,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b6aa574bb675b22e2041394c054945c
http://arxiv.org/abs/2005.13445
http://arxiv.org/abs/2005.13445
Limiting flight delays during operations has become a critical research topic in recent years due to their prohibitive impact on airlines, airports, and passengers. A popular strategy for addressing this problem considers the uncertainty of day-of-op
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3144b74e139148da273f4555d54cc182
http://arxiv.org/abs/2001.08548
http://arxiv.org/abs/2001.08548
This paper formulates a team orienteering problem with multiple fixed-wing drones and develops a branch-and-price algorithm to solve the problem to optimality. Fixed-wing drones, unlike rotary drones, have kinematic constraints associated with them,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3ba74a48e84a38a806da4d42783cbc1d
http://arxiv.org/abs/1912.04353
http://arxiv.org/abs/1912.04353
Publikováno v:
Mathematical Programming. 159:571-583
Based on a bijective mapping between two mixed integer sets, we introduce a new perspective on developing cuts for the mixed integer polyhedral conic (MIPC) set by establishing a one-to-one correspondence between the cuts for this set and those for a
Autor:
Sujeevraja Sanjeevi, Justin Yates
Publikováno v:
International Journal of Critical Infrastructure Protection. 6:107-119
This paper analyzes a variation of the shortest path network interdiction problem for homeland security scenarios pertaining to attacks on critical infrastructure and key resources that use highways in the transportation sector as conduits for gainin
Autor:
Kiavash Kianfar, Sujeevraja Sanjeevi
Publikováno v:
Discrete Optimization. 9:216-235
Gunluk and Pochet (O. Gunluk , Y. Pochet: Mixing mixed integer inequalities. Mathemat- ical Programming 90(2001) 429-457) proposed a procedure to mix mixed integer rounding (MIR) inequalities. The mixed MIR inequalities dene the convex hull of the mi
Autor:
Justin Yates, Sujeevraja Sanjeevi
Publikováno v:
Journal of Geographical Systems. 14:415-435
This paper examines the impact of arc metrics on the computational performance and spatial similarity in network interdiction modeling. Computational impact is measured in the number of iterations and total time required to reach an optimal solution.
Autor:
Kiavash Kianfar, Sujeevraja Sanjeevi
Publikováno v:
Discrete Applied Mathematics. 158:1861-1867
The single row facility layout problem (SRFLP) is the problem of arranging n departments with given lengths on a straight line so as to minimize the total weighted distance between all department pairs. We present a polyhedral study of the triplet fo
Autor:
Latha Nagendran, Sujeevraja Sanjeevi, V. Ramamurti, Vijay Srinivasan, Karthikeyan Ramesh Marambedu
Publikováno v:
International Journal of Computational Methods. :365-380
This paper presents a user-friendly procedure for preprocessing nodal and element data to be used in problems associated with cyclic symmetry. The concept of master, slave, adjacent and interior nodes is employed. Three types of industrial applicatio