Results 51 to 60 of about 976,293 (195)

Dynamic Three-Dimensional Surface Reconstruction Approach for Continuously Deformed Objects

open access: yesIEEE Photonics Journal, 2021
For dynamic three-dimensional (3-D) surface reconstruction of continuously deformed objects, an efficient method employing one fringe pattern is proposed.
Jianhua Wang, Yanxi Yang, Yuguo Zhou
doaj   +1 more source

Integrated Crew Scheduling and Roster Problem for Trainmasters of Passenger Railway Transportation

open access: yesIEEE Access, 2019
Train crew management is an imperative task in a passenger railway system and is typically decomposed into two sub-problems: crew scheduling problem and crew rostering problem.
Dung-Ying Lin, Meng-Rung Tsai
doaj   +1 more source

Proximal Branching of the Anterior Tibial Artery From the Popliteal Artery Increases the Risk of Vascular Injury During Total Knee Arthroplasty: A Retrospective Analysis Using Preoperative Magnetic Resonance Imaging and Intraoperative Findings

open access: yesGeriatric Orthopaedic Surgery & Rehabilitation, 2022
Introduction Arterial injury following total knee arthroplasty (TKA) can be life-threatening. There are some anatomical variations in the popliteal artery (PA) and its branches.
Yuya Kimura MD   +3 more
doaj   +1 more source

The structure of the South-Central-Pyrenean fold and thrust belt as constrained by subsurface data

open access: yesGeologica Acta, 2018
The interpretation of the available seismic lines of the South-Central-Pyrenean fold and thrust belt, conveniently tied with the exploration wells, define the main structural features of this realm of the Pyrenees.
J.A. MUÑOZ   +6 more
doaj  

Improved Sample Complexity Bounds for Branch-and-Cut

open access: yes, 2021
Branch-and-cut is the most widely used algorithm for solving integer programs, employed by commercial solvers like CPLEX and Gurobi. Branch-and-cut has a wide variety of tunable parameters that have a huge impact on the size of the search tree that it builds, but are challenging to tune by hand.
Balcan, Maria-Florina   +3 more
openaire   +4 more sources

The Team Orienteering Problem: Formulations and Branch-Cut and Price [PDF]

open access: yes, 2010
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical vehicles, with a limited total duration for their routes, is given.
Poggi, Marcus   +2 more
core   +1 more source

The Fruitless Branch and the Eternal Security of the Believer

open access: yesE-Journal of Religious and Theological Studies, 2022
The quest for the identification of the fruitless branch has been an enduring theological battleground between the Calvinists and the Arminians who argue as to whether or not the removal of the fruitless branch indicates the loss of eternal salvation.
Anthony Yaw Badu   +1 more
doaj   +1 more source

Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm [PDF]

open access: yesEuropean Journal of Operational Research, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tolga Bektaş   +3 more
openaire   +4 more sources

On the Yang-Lee and Langer singularities in the O(n) loop model

open access: yes, 2011
We use the method of `coupling to 2d QG' to study the analytic properties of the universal specific free energy of the O(n) loop model in complex magnetic field.
Fonseca P Zamolodchikov A   +11 more
core   +1 more source

A Branch-and-Cut algorithm for graph coloring

open access: yesDiscrete Applied Mathematics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Méndez-Díaz, I., Zabala, P.
openaire   +4 more sources

Home - About - Disclaimer - Privacy