Results 231 to 240 of about 28,771 (269)

A Branch-and-Cut Algorithm for the Median-Path Problem

Computational Optimization and Applications, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
P. Avella, M. Boccia, SFORZA, ANTONIO, I. Vasilev   +3 more
openaire   +3 more sources

A branch-and-cut algorithm for the Undirected Rural Postman Problem

Mathematical Programming, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
GHIANI, GIANPAOLO, G. LAPORTE
openaire   +2 more sources

A Branch-and-Cut Algorithm

2000
In this chapter, we describe the details of the implementation of a Branch-and-Cut algorithm for the 2CNBR problem. In Section 6.1, we address the problem of determining if a network is feasible. In Sections 6.2 to 6.8, we study the Separation problems for all the valid inequalities described in the previous chapters.
openaire   +1 more source

Branch‐and‐cut and Branch‐and‐cut‐and‐price algorithms for the adjacent only quadratic minimum spanning tree problem

Networks, 2015
The quadratic minimum spanning tree problem (QMSTP) consists of finding a spanning tree of a graph G such that a quadratic cost function is minimized. In its adjacent only version (AQMSTP), interaction costs only apply for edges that share an endpoint.
Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha   +2 more
openaire   +2 more sources

A branch-and-cut algorithm for the equicut problem

Mathematical Programming, 1997
We describe an algorithm for solving the equicut problem on complete graphs. The core of the algorithm is a cutting-plane procedure that exploits a subset of the linear inequalities defining the convex hull of the incidence vectors of the edge sets that define an equicut. The cuts are generated by several separation procedures that will be described in
Brunetta, L., CONFORTI, MICHELANGELO, Rinaldi, G.   +2 more
openaire   +4 more sources

A branch-and-cut algorithm for multiple sequence alignment

Mathematical Programming, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E. Althaus, CAPRARA, ALBERTO, H. P. Lenhof, K. Reinert   +3 more
openaire   +2 more sources

A branch-and-cut algorithm for vehicle routing problems

Annals of Operations Research, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Araque G., J. R., Kudva, G., Morin, T. L., Pekny, J. F.   +3 more
openaire   +2 more sources

A Branch and Cut Algorithm for a Steiner Tree-Star Problem

INFORMS Journal on Computing, 1996
This paper deals with a Steiner tree-star problem that is a special case of the degree constrained node-weighted Steiner tree problem. This problem arises in the context of designing telecommunications networks for digital data service, provided by regional telephone companies.
Lee, Youngho, Chiu, Steve Y., Ryan, Jennifer   +2 more
openaire   +1 more source

Autonomous Vehicle Cut-In Algorithm for Lane-Merging Scenarios via Policy-Based Reinforcement Learning Nested Within Finite-State Machine

IEEE Transactions on Intelligent Transportation Systems, 2022
Kibeom Lee, Hyeongseok Jeon, Dongsuk Kum
exaly  

A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints

European Journal of Operational Research, 2022
Xiangyi Zhang, Michel Gendreau
exaly