Results 101 to 110 of about 16,265 (145)
Some of the next articles are maybe not open access.
1996
Abstract As is frequently the case for MIP, instead of attempting to optimize (1.3) directly over P, it may be advantageous to divide that region into a finite number of smaller regions and optimize the objective function over each smaller region individually.
Abilio Lucena, John E Beasley
openaire +1 more source
Abstract As is frequently the case for MIP, instead of attempting to optimize (1.3) directly over P, it may be advantageous to divide that region into a finite number of smaller regions and optimize the objective function over each smaller region individually.
Abilio Lucena, John E Beasley
openaire +1 more source
A branch‐and‐cut algorithm for the preemptive swapping problem
Networks, 2009AbstractIn the swapping problem (SP), every vertex of a complete graph may supply and demand an object of a known type. A vehicle of unit capacity starting and ending its tour at an arbitrary vertex is available for carrying objects of given types between vertices.
Bordenave, Charles +2 more
openaire +2 more sources
A branch-and-cut algorithm for the restricted Block Relocation Problem
European Journal of Operational Research, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
T Bacci, S Mattia, P Ventura
openaire +3 more sources
A Branch and Cut Algorithm for DNA Encoding
2007 Second International Conference on Bio-Inspired Computing: Theories and Applications, 2007Encoding of information in DNA molecular is a crucial issue in DNA computing, and the coding problem plays an important role in DNA computation. In this paper, we consider the problem of DNA coding, and propose a branch and cut algorithm(BCA) to generate satisfactory single DNA sequences.
Zicheng Wang, Zehui Shao
openaire +1 more source
LaGO: a (heuristic) Branch and Cut algorithm for nonconvex MINLPs
Central European Journal of Operations Research, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nowak, Ivo, Vigerske, Stefan
openaire +1 more source
A Branch-and-Cut algorithm for factory crane scheduling problem
Journal of Global Optimization, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cheng, Xu +2 more
openaire +2 more sources
A Branch-and-Cut Algorithm for the Median-Path Problem
Computational Optimization and Applications, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
P. Avella +3 more
openaire +3 more sources
A branch-and-cut algorithm for the Undirected Rural Postman Problem
Mathematical Programming, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
GHIANI, GIANPAOLO, G. LAPORTE
openaire +2 more sources
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
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
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 +2 more
openaire +2 more sources
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 +2 more
openaire +2 more sources