Výsledky vyhľadávania - Exact branching algorithm
-
1
An improved model and exact algorithm using local branching for the inventory-routing problem with time windows
ISSN: 0020-7543, 1366-588XVydavateľské údaje: London Taylor & Francis 02.01.2023Vydané v International journal of production research (02.01.2023)“… 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…”
Získať plný text
Journal Article -
2
The perfect matching cut problem revisited
ISSN: 0304-3975, 1879-2294Vydavateľské údaje: Elsevier B.V 29.09.2022Vydané v Theoretical computer science (29.09.2022)“… 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…”
Získať plný text
Journal Article -
3
Matching Cut in Graphs with Large Minimum Degree
ISSN: 0178-4617, 1432-0541Vydavateľské údaje: New York Springer US 01.05.2021Vydané v Algorithmica (01.05.2021)“… ut has no subexponential-time algorithm in the number of vertices unless the Exponential-Time Hypothesis fails…”
Získať plný text
Journal Article -
4
Branch &Memorize exact algorithms for sequencing problems: Efficient embedding of memorization into search trees
ISSN: 0305-0548, 1873-765XVydavateľské údaje: Elsevier Ltd 01.04.2021Vydané v Computers & operations research (01.04.2021)“…•We focus on sequencing optimization problems.•We provide a framework for memorization techniques within branching algorithms…”
Získať plný text
Journal Article -
5
A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars
ISSN: 0020-0190, 1872-6119Vydavateľské údaje: Amsterdam Elsevier B.V 01.05.2013Vydané v Information processing letters (01.05.2013)“…We provide a strongly polynomial algorithm for determining whether a given multi-type branching process is subcritical, critical, or supercritical…”
Získať plný text
Journal Article -
6
Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover
ISSN: 0304-3975, 1879-2294Vydavateľské údaje: Elsevier B.V 04.01.2016Vydané v Theoretical computer science (04.01.2016)“…We investigate the gap between theory and practice for exact branching algorithms…”
Získať plný text
Journal Article -
7
Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
ISSN: 0377-2217, 1872-6860Vydavateľské údaje: Amsterdam Elsevier B.V 16.05.2010Vydané v European journal of operational research (16.05.2010)“… We use exact as well as approximate algorithms. The exact algorithm is a properly modified version of the multicriteria branch and bound (MCBB…”
Získať plný text
Journal Article -
8
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set
ISSN: 0178-4617, 1432-0541Vydavateľské údaje: New York Springer US 01.08.2021Vydané v Algorithmica (01.08.2021)“…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…”
Získať plný text
Journal Article -
9
A cut-and-solve based algorithm for the single-source capacitated facility location problem
ISSN: 0377-2217, 1872-6860Vydavateľské údaje: Amsterdam Elsevier B.V 16.09.2012Vydané v European journal of operational research (16.09.2012)“…) based exact algorithm for the Single Source Capacitated Facility Location Problem (SSCFLP). At each level…”
Získať plný text
Journal Article -
10
Neural network assisted branch and bound algorithm for dynamic berth allocation problems
ISSN: 0377-2217Vydavateľské údaje: Elsevier B.V 01.12.2024Vydané v European journal of operational research (01.12.2024)“… 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…”
Získať plný text
Journal Article -
11
Heuristic and exact algorithms for a min–max selective vehicle routing problem
ISSN: 0305-0548, 1873-765X, 0305-0548Vydavateľské údaje: Kidlington Elsevier Ltd 01.07.2011Vydané v Computers & operations research (01.07.2011)“… We propose two exact solution approaches for solving the problem: a branch-and-cut (BC) algorithm and a local branching (LB…”
Získať plný text
Journal Article -
12
A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts
ISSN: 0305-0548, 0305-0548Vydavateľské údaje: New York Elsevier Ltd 01.12.2021Vydané v Computers & operations research (01.12.2021)“…•The branch-and-price algorithm is competitive with state-of-the-art exact methods.•Competiveness is mainly achieved thanks to the proposed branching rules…”
Získať plný text
Journal Article -
13
On Independent Sets and Bicliques in Graphs
ISSN: 0178-4617, 1432-0541Vydavateľské údaje: New York Springer-Verlag 01.04.2012Vydané v Algorithmica (01.04.2012)“… ) 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…”
Získať plný text
Journal Article -
14
CliSAT: A new exact algorithm for hard maximum clique problems
ISSN: 0377-2217, 1872-6860Vydavateľské údaje: Elsevier B.V 16.06.2023Vydané v European journal of operational research (16.06.2023)“…•A new exact combinatorial branch-and-bound algorithm for the maximum clique problem (MCP) is designed…”
Získať plný text
Journal Article -
15
An Improved Spatial Branch-and-Bound Algorithm for Non-Convex Optimal Electricity-Gas Flow
ISSN: 0885-8950, 1558-0679Vydavateľské údaje: New York IEEE 01.03.2022Vydané v IEEE transactions on power systems (01.03.2022)“… 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…”
Získať plný text
Journal Article -
16
Advice complexity of adaptive priority algorithms
ISSN: 0304-3975Vydavateľské údaje: 12.02.2024Vydané v Theoretical computer science (12.02.2024)Získať plný text
Journal Article -
17
An improved local branching approach for train formation planning
ISSN: 0307-904XVydavateľské údaje: Elsevier Inc 15.02.2013Vydané v Applied mathematical modelling (15.02.2013)“… In this paper, an improved local branching algorithm is proposed for the TFP model in Iranian railway…”
Získať plný text
Journal Article -
18
An exact algorithm for the adjacent vertex distinguishing sum edge coloring problem
ISSN: 0166-218XVydavateľské údaje: Elsevier B.V 15.08.2025Vydané v Discrete Applied Mathematics (15.08.2025)“…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…”
Získať plný text
Journal Article -
19
Maximization of submodular functions: Theory and enumeration algorithms
ISSN: 0377-2217, 1872-6860Vydavateľské údaje: Amsterdam Elsevier B.V 01.10.2009Vydané v European journal of operational research (01.10.2009)“…, 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…”
Získať plný text
Journal Article -
20
Estimation of Space-Time Branching Process Models in Seismology Using an EM-Type Algorithm
ISSN: 0162-1459, 1537-274XVydavateľské údaje: Alexandria, VA Taylor & Francis 01.06.2008Vydané v Journal of the American Statistical Association (01.06.2008)“…Maximum likelihood estimation of branching point process models via numerical optimization procedures can be unstable and computationally intensive…”
Získať plný text
Journal Article