Results 31 to 40 of about 9,957 (290)
This paper presents a proposal for optimizing the public health service in the state of Parana in terms of the flow of patients within the state's boundaries and the regionalization (division) of the state into new hierarchical configurations for this ...
Cassius Tadeu Scarpin +3 more
doaj +1 more source
A Branch and Price Algorithm for List Coloring Problem
Coloring problems in graphs have been used to model a wide range of real applications. In particular, the List Coloring Problem generalizes the well-known Graph Coloring Problem for which many exact algorithms have been developed. In this work, we present a Branch-and-Price algorithm for the weighted version of the List Coloring Problem, based on the ...
Mauro Lucci +2 more
openaire +5 more sources
A tutorial on Branch-Price-and-Cut algorithms
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Petris, Matteo +4 more
openaire +1 more source
A Price-and-Branch algorithm for a drayage problem with heterogeneous trucks [PDF]
This paper investigates a drayage problem, which is motivated by a carrier providing door-to-door freight transportation services by trucks and containers. The trucks carry one or two containers to ship container loads from a port to importers and from exporters to the same port.
Ali Ghezelsoflu +3 more
openaire +5 more sources
Branch-and-price algorithm flowchart.
Branch-and-price algorithm flowchart.
Tianwei Zhang (169823) +2 more
core +1 more source
Selective pricing in branch-price-and-cut algorithms for vehicle routing
Branch-price-and-cut is a leading methodology for solving various vehicle routing problems (VRPs). For many VRPs, the pricing subproblem of a branch-price-and-cut algorithm is highly time consuming, and to alleviate this difficulty, a relaxed pricing subproblem is used.
Guy Desaulniers +2 more
openaire +2 more sources
In the transportation industry, crew management is typically decomposed into two phases: crew scheduling and crew rostering. Due to the complexity of scheduling and rostering, bus transportation is not an exception and many relevant studies do not ...
Dung-Ying Lin +2 more
doaj +1 more source
A branch‐and‐cut‐and‐price algorithm for vertex‐biconnectivity augmentation [PDF]
AbstractIn this article, the first approach for solving the vertex‐biconnectivity augmentation problem (V2AUG) to optimality is proposed. Given a spanning subgraph of an edge‐weighted graph, we search for the cheapest subset of edges to augment this subgraph to make it vertex‐biconnected.
openaire +1 more source
A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem [PDF]
In this paper, we propose a multiperiod single-sourcing problem (MPSSP), which takes both transportation and inventory into consideration, suitable for evaluating the performance of a logistics distribution network in a dynamic environment. We reformulate the MPSSP as a Generalized Assignment Problem (GAP) with a convex objective function.
Richard Freling +3 more
openaire +10 more sources
Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur +11 more
wiley +1 more source

