• Aucun résultat trouvé

Branch-And-Bound algorithm

Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth

Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth

... new branch and bound algorithm for computing the pathwidth of graphs and the vertex-separation of ...digraph and new cutting rules allowing for significantly reducing the search ...

305

A Branch-and-Bound Algorithm for Quadratically-Constrained Sparse Filter Design

A Branch-and-Bound Algorithm for Quadratically-Constrained Sparse Filter Design

... 3. Branch-and-bound algorithm run to completion; however, the amount of pruning and hence the rate of convergence would decrease with an inferior initial ...The algorithm uses a ...

15

Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth

Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth

... Solano and Pioro proposed in [37] an exact branch and bound algorithm to compute the pathwidth of graphs, that checks all possible layout of the nodes and keep the best ...[2,37] ...

305

Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth

Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth

... Contributions and organization of the paper We design a Branch and Bound algorithm that computes the exact directed pathwidth of digraphs and a corresponding ...our ...

23

A Branch and Bound Algorithm for Choquet Optimization in Multicriteria Problems

A Branch and Bound Algorithm for Choquet Optimization in Multicriteria Problems

... lower bound (resp. upper bound), and the best choice for these weights ...lower bound, resp. the lowest upper bound) depends on the subproblem to deal ...the branch and ...

10

Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n,p)$ random model

Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n,p)$ random model

... a branch-&-bound where the search-tree is pruned only on branches rooted at nodes that correspond to infeasible partial ...upper bound on the best solution that will be built when the node is ...

15

A combinatorial branch-and-bound algorithm for box search

A combinatorial branch-and-bound algorithm for box search

... mining and can be formulated as a mixed-integer linear ...a branch-and-bound algorithm where the bounding is obtained by combinatorial arguments instead of the traditional linear ...The ...

18

A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems

A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems

... Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems 3 1 Introduction Combinatorial optimization addresses problems for which the resolution ...

19

A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems

A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems

... A tight upper bound at each node of the search tree Before starting the branch-and-bound procedure : preprocessing techniques... Standard B&B approach (SBB)1[r] ...

24

Revisiting the upper bounding process in a safe Branch and Bound algorithm

Revisiting the upper bounding process in a safe Branch and Bound algorithm

... equations and inequalities whi h provides very a urate approxima- tions of feasible points at a low omputational ...onstrained, and has therefore an ane spa e of ...

6

Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound

Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound

... LP/NLP-based branch-and-bound algorithm to solve at optimality a non-convex formulation of the pump scheduling problem in ...cuts, and a new primal heuristic to turn slightly infeasible ...

43

Convergence-order analysis of branch-and-bound algorithms for constrained problems

Convergence-order analysis of branch-and-bound algorithms for constrained problems

... deterministic branch-and-bound algorithm is the order of convergence of its bounding scheme, which, for the case of unconstrained optimization, compares the rate of convergence of an estimated ...

55

Interval Branch and Bound Algorithms dealing with Black-Box Constraints

Interval Branch and Bound Algorithms dealing with Black-Box Constraints

... (4) and just to consider the Program (3) for im- proving the current solutions ...a Branch and Bound algorithm proceeds by exclusions of boxes when it is proven that the global solution ...

5

Algorithmes Branch&Bound Pair-à-Pair pour Grilles de Calcul

Algorithmes Branch&Bound Pair-à-Pair pour Grilles de Calcul

... solution and other collaboration tasks to reduce the load on the ...the algorithm still relies heavily on the master entity and thus, remains an obstacle to ...the ...

64

A branch and bound approach for minimizing the energy consumption of an electrical vehicle

A branch and bound approach for minimizing the energy consumption of an electrical vehicle

... Þnite and could be ...steps and the Þnite set of possible points becomes rapidly too huge to be entirely enumerated in a reasonable ...a Branch and Bound algorithm in order to ...

5

A standard branch-and-bound approach for nonlinear semi-infinite problems

A standard branch-and-bound approach for nonlinear semi-infinite problems

... of branch-and-bound algorithms to SIPs by integrating SICs in the process just as regular non-linear ...the branch-and-bound algorithm to SICs: In particular, we 1) show ...

35

A branch and bound approach for minimizing the energy consumption of an electrical vehicle

A branch and bound approach for minimizing the energy consumption of an electrical vehicle

... iref and the ith discretized value for the speed, the other initial values are taken equal to 0: ...Ω and pos by computing the integer sets I and J of the indices corresponding to the possible values ...

4

BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems

BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems

... −X ij − X ik + X jk ≥ −1. These inequalities correspond to the fact that for x ∈ {−1, 1} n+1 , it is not possible to have exactly one of three products {x i x j , x i x k , x j x k } equal to −1, nor is it possible to ...

24

A Supervised Machine Learning Approach to Variable Branching in Branch-And-Bound

A Supervised Machine Learning Approach to Variable Branching in Branch-And-Bound

... learning algorithm to learn a function imitating strong branching ...B&B, and evaluate its efficiency on a set of standard benchmark problems, the MIPLIB [ 3 , 9 ...

16

Branch-and-Bound with Peer-to-Peer for Large-Scale Grids

Branch-and-Bound with Peer-to-Peer for Large-Scale Grids

... migrations and bad migration decisions, therefore poor performance on Jacobi ...oriented algorithm produced low mean times for low rate of migrations (an initial distribution near to the optimal), the P2P ...

189

Show all 10000 documents...

Sujets connexes