Search Results - Exact branching algorithm

An improved model and exact algorithm using local branching for the inventory-routing problem with time windows.

Authors: Demantova, Bruno E. Scarpin, Cassius T. Coelho, Leandro C. et al.

Source: International Journal of Production Research. Jan 2023, Vol. 61 Issue 1, p49-64. 16p. 2 Diagrams, 13 Charts.

Subject Terms: *ALGORITHMS, VEHICLE routing problem, AUTHORSHIP, ROUTING algorithms

Exact Rates of Convergence for a Branching Particle Approximation to the Solution of the Zakai Equation

Authors: Crisan, Dan

Source: The Annals of Probability, 2003 Apr 01. 31(2), 693-718.

Access URL: https://www.jstor.org/stable/3481658

Theory and Practice of Exact Algorithms for NP-Hard Problems : Branching and Reduction

Authors: 岩田, 陽一

File Description: application/pdf

Access URL: https://ndlsearch.ndl.go.jp/books/R100000039-I10982503

Degree: 博士(情報理工学) -- University of Tokyo(東京大学)

Efficient algorithms for solving p-median problems with radius constraints, and its application to clustering with feature selection

Authors: Martín del Campo Barraza, Minerva Montserrat Garcia Quiles, Sergio Kalcsics, Joerg

Contributors: Martín del Campo Barraza, Minerva Montserrat Garcia Quiles, Sergio Kalcsics, Joerg

Subject Terms: p-median problem, exact algorithm, radius formulation, cluster analysis, pattern variables

Access URL: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.841912

Constrained Two-Dimensional Cutting: An Improvement of Christofides and Whitlock's Exact Algorithm

Authors: Hifi, M. Zissimopoulos, V.

Source: The Journal of the Operational Research Society, 1997 Mar 01. 48(3), 324-331.

Access URL: https://www.jstor.org/stable/3010432

Branching and annihilating random walks: exact results at low branching rate.

Authors: Benitez F Wschebor N

Source: Physical review. E, Statistical, nonlinear, and soft matter physics [Phys Rev E Stat Nonlin Soft Matter Phys] 2013 May; Vol. 87 (5), pp. 052132. Date of Electronic Publication: 2013 May 28.

Publication Type: Journal Article; Research Support, Non-U.S. Gov't

Journal Info: Publisher: American Physical Society Country of Publication: United States NLM ID: 101136452 Publication Model: Print-Electronic Cited Medium: Internet ISSN: 1550-2376 (Electronic) Linking ISSN: 15393755 NLM ISO Abbreviation: Phys Rev E Stat Nonlin Soft Matter Phys Subsets: MEDLINE

MeSH Terms: Algorithms* , Diffusion* , Models, Statistical* , Numerical Analysis, Computer-Assisted*, Computer Simulation

Cutting and packing : problems, models and exact algorithms

Authors: Alves, Cláudio Carvalho, J. M. Valério de Universidade do Minho

Contributors: Alves, Cláudio Carvalho, J. M. Valério de Universidade do Minho

File Description: application/pdf

Availability: https://hdl.handle.net/1822/2577

Exact Solutions for Sturm-Liouville Problems on Trees via Novel Substitute Systems and the Wittrick-Williams Algorithm

Authors: Williams, Fred W. Watson, Andrew Howson, W. Paul et al.

Source: Proceedings: Mathematical, Physical and Engineering Sciences, 2007 Dec 01. 463(2088), 3195-3224.

Access URL: https://www.jstor.org/stable/20209371

Matching Cut in Graphs with Large Minimum Degree.

Authors: Chen, Chi-Yeh Hsieh, Sun-Yuan Le, Hoang-Oanh et al.

Source: Algorithmica. May2021, Vol. 83 Issue 5, p1238-1255. 18p.

Subject Terms: *POLYNOMIAL time algorithms, *MAXIMA & minima, *CUTTING stock problem, *NP-hard problems, *GRAPH algorithms, *BIPARTITE graphs

Nesting Problems : Exact and Heuristic Algorithms

Authors: Martínez Sykora, Antonio

Thesis Advisors: Álvarez-Valdés Olaguíbel, Ramón, Tamarit Goerlich, José Manuel, Departament d'Estadística i Investigació Operativa

Subject Terms: integer programming, nesting, cutting and packing, UNESCO::MATEMÁTICAS::Investigación operativa::Programación entera, UNESCO::MATEMÁTICAS::Investigación operativa

Access URL: http://hdl.handle.net/10550/29003

Nesting Problems : Exact and Heuristic Algorithms

Authors: Martínez Sykora, Antonio

Thesis Advisors: Álvarez-Valdés Olaguíbel, Ramón, Tamarit Goerlich, José Manuel, Departament d'Estadística i Investigació Operativa

Subject Terms: integer programming, nesting, cutting and packing, UNESCO::MATEMÁTICAS::Investigación operativa::Programación entera, UNESCO::MATEMÁTICAS::Investigación operativa

Access URL: http://hdl.handle.net/10803/568268

Nesting Problems : Exact and Heuristic Algorithms

Authors: Martínez Sykora, Antonio

Thesis Advisors: Álvarez-Valdés Olaguíbel, Ramón, Tamarit Goerlich, José Manuel, Departament d'Estadística i Investigació Operativa

Subject Terms: integer programming, nesting, cutting and packing, UNESCO::MATEMÁTICAS::Investigación operativa::Programación entera, UNESCO::MATEMÁTICAS::Investigación operativa

Access URL: http://hdl.handle.net/10550/29003

Models and Algorithms for Location-Routing and Related Problems

Authors: Albareda Sambola, Maria

Contributors: University/Department: Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa

Thesis Advisors: Fernández, Elena (Fernández Aréizaga), Laporte, Gilbert

Source: TDX (Tesis Doctorals en Xarxa)

Subject Terms: stochastic assignment, location-routing, logistic systems, 1207. Investigació operativa

Time: 519.1

File Description: application/pdf

Access URL: http://www.tdx.cat/TDX-1019104-175236
http://hdl.handle.net/10803/6510
https://dx.doi.org/10.5821/dissertation-2117-93821

Large scale geostatistics with locally varying anisotropy

Authors: Peredo Andrade, Oscar Francisco

Contributors: University/Department: Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors

Thesis Advisors: Herrero Zaragoza, José Ramón

Source: TDX (Tesis Doctorals en Xarxa)

Subject Terms: Àrees temàtiques de la UPC::Informàtica

File Description: application/pdf

Access URL: http://hdl.handle.net/10803/674552
https://dx.doi.org/10.5821/dissertation-2117-369087

The perfect matching cut problem revisited.

Authors: Le, Van Bang Telle, Jan Arne

Source: Theoretical Computer Science. Sep2022, Vol. 931, p117-130. 14p.

Subject Terms: *CUTTING stock problem, *BIPARTITE graphs, *GRAPH algorithms, *ALGORITHMS

A Refined Branching Algorithm for the Maximum Satisfiability Problem.

Authors: Li, Wenjun Xu, Chao Yang, Yongjie et al.

Source: Algorithmica. Apr2022, Vol. 84 Issue 4, p982-1006. 25p.

Subject Terms: *NP-hard problems, *ALGORITHMS, *BRANCHING processes

Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms.

Authors: Komusiewicz, Christian Kratsch, Dieter Le, Van Bang

Source: Discrete Applied Mathematics. Sep2020, Vol. 283, p44-58. 15p.

Subject Terms: *ALGORITHMS, *NP-hard problems, *MATCHING theory

Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover.

Authors: Akiba, Takuya Iwata, Yoichi

Source: Theoretical Computer Science. Jan2016 Part 1, Vol. 609, p211-225. 15p.

Subject Terms: *GEOMETRIC vertices, *BRANCHING processes, *COMPUTATIONAL complexity, *EMPIRICAL research, *EXPONENTIAL functions

An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs

Authors: Aleksandar Shurbevski Hiroshi Nagamochi Norhazwani Md Yunos

Source: Journal of Information Processing. 2017, 25:639

An Exact Algorithm for Oblivious Read-Twice Branching Program Satisfiability

Authors: Junichi TERUYAMA Kazuhisa SETO

Source: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 2016, E99.A(6):1019