Suchergebnisse - Exact branching algorithm

An improved model and exact algorithm using local branching for the inventory-routing problem with time windows von Demantova, Bruno E., Scarpin, Cassius T., Coelho, Leandro C., Darvish, Maryam

“… A combination of tools ranging from established groups of valid inequalities, pre-processing techniques, local search procedures, and a local branching algorithm is utilised to solve the IRPTW efficiently …”
Volltext

The perfect matching cut problem revisited von Le, Van Bang, Telle, Jan Arne

“… Assuming the Exponential Time Hypothesis, we show there is no O⁎(2o(n))-time algorithm for pmc even when restricted to n-vertex bipartite graphs, and also show that pmc can be solved in O⁎(1.2721n) time by means of an exact branching algorithm …”
Volltext

Matching Cut in Graphs with Large Minimum Degree von Chen, Chi-Yeh, Hsieh, Sun-Yuan, Le, Hoang-Oanh, Le, Van Bang, Peng, Sheng-Lung

“… ut has no subexponential-time algorithm in the number of vertices unless the Exponential-Time Hypothesis fails …”
Volltext

Branch &Memorize exact algorithms for sequencing problems: Efficient embedding of memorization into search trees von Shang, Lei, T’Kindt, Vincent, Della Croce, Federico

“… •We focus on sequencing optimization problems.•We provide a framework for memorization techniques within branching algorithms …”
Volltext

A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars von Esparza, Javier, Gaiser, Andreas, Kiefer, Stefan

“… We provide a strongly polynomial algorithm for determining whether a given multi-type branching process is subcritical, critical, or supercritical …”
Volltext

Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover von Akiba, Takuya, Iwata, Yoichi

“… We investigate the gap between theory and practice for exact branching algorithms …”
Volltext

Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms von Florios, Kostas, Mavrotas, George, Diakoulaki, Danae

“… We use exact as well as approximate algorithms. The exact algorithm is a properly modified version of the multicriteria branch and bound (MCBB …”
Volltext

Improved Analysis of Highest-Degree Branching for Feedback Vertex Set von Iwata, Yoichi, Kobayashi, Yusuke

“… Recent empirical evaluations of exact algorithms for Feedback Vertex Set have demonstrated the efficiency of a highest-degree branching algorithm with a degree-based pruning …”
Volltext

A cut-and-solve based algorithm for the single-source capacitated facility location problem von Yang, Zhen, Chu, Feng, Chen, Haoxun

“… ) based exact algorithm for the Single Source Capacitated Facility Location Problem (SSCFLP). At each level …”
Volltext

Neural network assisted branch and bound algorithm for dynamic berth allocation problems von Korekane, Shinya, Nishi, Tatsushi, Tierney, Kevin, Liu, Ziang

“… This problem can be solved using exact solution methods such as branch and bound (BB) algorithms or heuristic methods, however, exact methods do not scale to large-scale terminal operations …”
Volltext

Heuristic and exact algorithms for a min–max selective vehicle routing problem von Valle, Cristiano Arbex, Martinez, Leonardo Conegundes, da Cunha, Alexandre Salles, Mateus, Geraldo R.

“… We propose two exact solution approaches for solving the problem: a branch-and-cut (BC) algorithm and a local branching (LB …”
Volltext

A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts von Bianchessi, Nicola, Tresoldi, Emanuele

“… •The branch-and-price algorithm is competitive with state-of-the-art exact methods.•Competiveness is mainly achieved thanks to the proposed branching rules …”
Volltext

On Independent Sets and Bicliques in Graphs von Gaspers, Serge, Kratsch, Dieter, Liedloff, Mathieu

“… ) and show that the maximum number of maximal bicliques in a graph on n vertices is Θ(3 n /3 ). Our major contribution is an exact exponential-time algorithm …”
Volltext

CliSAT: A new exact algorithm for hard maximum clique problems von San Segundo, Pablo, Furini, Fabio, Álvarez, David, Pardalos, Panos M.

“… •A new exact combinatorial branch-and-bound algorithm for the maximum clique problem (MCP) is designed …”
Volltext

An Improved Spatial Branch-and-Bound Algorithm for Non-Convex Optimal Electricity-Gas Flow von Liu, Pengxiang, Wu, Zhi, Gu, Wei, Lu, Yuping

“… In this paper, an improved spatial branch-and-bound algorithm is proposed to solve the non-convex problem, which is formulated as a mixed-integer bilinear programming, for its exact solution …”
Volltext

Advice complexity of adaptive priority algorithms von Boyar, Joan, Larsen, Kim S., Pankratov, Denis

Volltext

An improved local branching approach for train formation planning von Yaghini, Masoud, Momeni, Mohsen, Sarmadi, Mohammadreza

“… In this paper, an improved local branching algorithm is proposed for the TFP model in Iranian railway …”
Volltext

An exact algorithm for the adjacent vertex distinguishing sum edge coloring problem von Curcio, Brian, Méndez-Díaz, Isabel, Zabala, Paula

“… In this work we define the adjacent vertex distinguishing sum edge coloring problem. This problem consists of finding an assignment of colors to the edges of a …”
Volltext

Maximization of submodular functions: Theory and enumeration algorithms von Goldengorin, Boris

“… , Cherenin’s selection rules and his Dichotomy Algorithm, we revise the above mentioned theory and show that our revision is useful for creating new non-binary branching algorithms and finding either …”
Volltext

Estimation of Space-Time Branching Process Models in Seismology Using an EM-Type Algorithm von Veen, Alejandro, Schoenberg, Frederic P

“… Maximum likelihood estimation of branching point process models via numerical optimization procedures can be unstable and computationally intensive …”
Volltext