Zobrazeno 1 - 10
of 2 635
pro vyhledávání: '"Local Branching"'
We present a method of solving a nonlinear Dirichlet problem with discontinuous boundary data and we give a probabilistic representation of the solution using the nonlocal branching process associated with the nonlinear term of the operator. Instead
Externí odkaz:
http://arxiv.org/abs/2410.16988
Autor:
Demantova, Bruno E.1 (AUTHOR), Scarpin, Cassius T.1 (AUTHOR), Coelho, Leandro C.2,3,4 (AUTHOR), Darvish, Maryam2,3 (AUTHOR) maryam.darvish@fsa.ulaval.ca
Publikováno v:
International Journal of Production Research. Jan 2023, Vol. 61 Issue 1, p49-64. 16p. 2 Diagrams, 13 Charts.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Accelerated Benders Decomposition and Local Branching for Dynamic Maximum Covering Location Problems
The maximum covering location problem (MCLP) is a key problem in facility location, with many applications and variants. One such variant is the dynamic (or multi-period) MCLP, which considers the installation of facilities across multiple time perio
Externí odkaz:
http://arxiv.org/abs/2309.00702
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Boukhari, Samah1 (AUTHOR) boukhari.samah.ro@gmail.com, Hifi, Mhand2 (AUTHOR) hifi@u-picardie.fr
Publikováno v:
International Transactions in Operational Research. Jan2024, Vol. 31 Issue 1, p29-52. 24p.
Large Neighborhood Search (LNS) is a popular heuristic algorithm for solving combinatorial optimization problems (COP). It starts with an initial solution to the problem and iteratively improves it by searching a large neighborhood around the current
Externí odkaz:
http://arxiv.org/abs/2212.08183
We provide a many-to-few formula in the general setting of non-local branching Markov processes. This formula allows one to compute expectations of k-fold sums over functions of the population at k different times. The result generalises [14] to the
Externí odkaz:
http://arxiv.org/abs/2211.08662
Autor:
Beasley, John E
In this paper we present a heuristic for the non-unicost set covering problem using local branching. Local branching eliminates the need to define a problem specific search neighbourhood for any particular (zero-one) optimisation problem. It does thi
Externí odkaz:
http://arxiv.org/abs/2207.03248
Finding high-quality solutions to mixed-integer linear programming problems (MILPs) is of great importance for many practical applications. In this respect, the refinement heuristic local branching (LB) has been proposed to produce improving solution
Externí odkaz:
http://arxiv.org/abs/2112.02195