Branch-cut-price algorithms for solving a class of search problems on general graphs
Sign Up to like & getrecommendations! Published in 2017 at "Networks"
DOI: 10.1002/net.21740
Abstract: We consider graph search problems involving an intruder and mobile searchers. The graph consists of nodes on which the intruder and searchers may be located, and edges on which these entities travel. Associated with each… read more here.
Keywords: branch cut; search; search problems; cut price ... See more keywords
Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem
Sign Up to like & getrecommendations! Published in 2018 at "Networks"
DOI: 10.1002/net.21787
Abstract: Given a complete and undirected graph G, the adjacent only quadratic minimum spanning tree problem (AQMSTP) consists of finding a spanning tree that minimizes a quadratic function of its adjacent edges. The strongest AQMSTP linear… read more here.
Keywords: branch cut; lagrangian relaxation; adjacent quadratic; problem ... See more keywords
A branch‐and‐cut approach for the least cost influence problem on social networks
Sign Up to like & getrecommendations! Published in 2020 at "Networks"
DOI: 10.1002/net.21941
Abstract: This paper studies a problem in the online targeted marketing setting called the least cost influence problem (LCIP) that is known to be NP‐hard. The goal is to find the minimum total amount of inducements… read more here.
Keywords: branch cut; problem; cut approach; influence ... See more keywords
A branch-and-cut algorithm for the maximum covering cycle problem
Sign Up to like & getrecommendations! Published in 2020 at "Annals of Operations Research"
DOI: 10.1007/s10479-018-2856-5
Abstract: In many applications, such as telecommunications and routing, we seek for cost-effective infrastructure or operating layouts so that many nodes (e.g., customers) of a support network (typically modeled by a graph) are covered by, or… read more here.
Keywords: cycle; covering cycle; maximum covering; cycle problem ... See more keywords
A capacitated multi pickup online food delivery problem with time windows: a branch-and-cut algorithm
Sign Up to like & getrecommendations! Published in 2021 at "Annals of Operations Research"
DOI: 10.1007/s10479-021-04145-6
Abstract: Online food delivery companies, nowadays, allow a customer to place an order for a combination of dishes from one or more restaurants. To meet a customer’s demand, the company then arranges for the pickups from… read more here.
Keywords: branch cut; delivery; food delivery; time windows ... See more keywords
A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
Sign Up to like & getrecommendations! Published in 2020 at "Computational Optimization and Applications"
DOI: 10.1007/s10589-019-00153-2
Abstract: We consider a cutting-plane algorithm for solving mixed-integer semidefinite optimization (MISDO) problems. In this algorithm, the positive semidefinite (psd) constraint is relaxed, and the resultant mixed-integer linear optimization problem is solved repeatedly, imposing at each… read more here.
Keywords: optimization; mixed integer; branch cut; cut algorithm ... See more keywords
A branch and cut algorithm for the capacitated star–star telecommunication network problem
Sign Up to like & getrecommendations! Published in 2019 at "Optimization Letters"
DOI: 10.1007/s11590-018-1282-6
Abstract: In this study, a branch and cut algorithm is generated for a telecommunication network problem with bi-hierarchical star–star design and fixed identical concentrator capacities. The problem aims to find out how many and on which… read more here.
Keywords: telecommunication network; problem; cut algorithm; network problem ... See more keywords
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
Sign Up to like & getrecommendations! Published in 2018 at "EURO Journal on Computational Optimization"
DOI: 10.1007/s13675-017-0091-5
Abstract: In this paper, we present a state-of-the-art branch-and-cut (B&C) algorithm for the multicommodity capacitated fixed charge network design problem (MCND). This algorithm combines bounding and branching procedures inspired by the latest developments in mixed-integer programming… read more here.
Keywords: branch cut; multicommodity capacitated; fixed charge; cut algorithm ... See more keywords
An Improved Augmented $\varepsilon$ -Constraint and Branch-and-Cut Method to Solve the TSP With Profits
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Transactions on Intelligent Transportation Systems"
DOI: 10.1109/tits.2018.2808179
Abstract: In this paper, a novel approach is presented to solve the traveling salesman problem with profits (TSPP). This problem is an extension of the famous traveling salesman problem (TSP) in which a prize is associated… read more here.
Keywords: varepsilon constraint; constraint branch; problem; method ... See more keywords