Results 221 to 230 of about 28,771 (269)

Efficient Branch-and-Cut Algorithms for Submodular Function Maximization

Efficient Branch-and-Cut Algorithms for Submodular Function Maximization
openaire  

Some of the next articles are maybe not open access.

Related searches:

Declawing a graph: polyhedra and Branch-and-Cut algorithms

Journal of Combinatorial Optimization, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Felipe C. Fragoso, Gilberto F. de Sousa Filho, Fábio Protti   +2 more
openaire   +1 more source

Branch‐and‐cut algorithms for the ‐arborescence star problem

International Transactions in Operational Research, 2020
AbstractGiven a connected digraph, a vertex designated as the root, and an integer , the ‐arborescence star problem is to choose vertices besides the root and define a reverse arborescence spanning them. Each vertex outside the arborescence must be assigned to one vertex inside it.
Armando Honorio Pereira, Geraldo Robson Mateus, Sebastián Urrutia   +2 more
openaire   +1 more source

New Branch-and-Cut Algorithm for Bilevel Linear Programming

Journal of Optimization Theory and Applications, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Audet, C., Savard, G., Zghal, W.
openaire   +1 more source

Branch and cut algorithms

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

A branch‐and‐cut algorithm for the preemptive swapping problem

Networks, 2009
AbstractIn 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, Gendreau, Michel, Laporte, G.   +2 more
openaire   +2 more sources

A branch-and-cut algorithm for the restricted Block Relocation Problem

European Journal of Operational Research, 2020
zbMATH 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, 2007
Encoding 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, 2007
zbMATH 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, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cheng, Xu, Tang, Lixin, Pardalos, Panos M.   +2 more
openaire   +2 more sources