Results 91 to 100 of about 976,293 (195)

A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem [PDF]

In open vehicle routing problems, the vehicles are not required to return to the depot after completing service. In this paper, we present the first exact optimization algorithm for the open version of the well-known capacitated vehicle routing problem ...
Eglese, Richard W., Letchford, Adam N., Lysgaard, Jens   +2 more
core  

The commodity constrained split delivery vehicle routing problem considering carbon emission: Formulations and a branch-and-cut method

EURO Journal on Transportation and Logistics
This paper introduces the Green Commodity constrained Split Delivery Vehicle Routing Problem (GC-SDVRP), which involves designing efficient and environmentally friendly delivery routes that reduce the CO2 emissions associated with transporting multiple ...
Kamyla Maria Ferreira, Claudia Archetti, Diego Delle Donne, Reinaldo Morabito, Pedro Munari   +4 more
doaj   +1 more source

Using infeasible path cuts to solve Electric Vehicle Routing Problems with realistic charging functions exactly within a branch-and-cut framework

EURO Journal on Transportation and Logistics
The paper investigates the Electric Vehicle Routing Problem with a non-linear concave and strictly monotonic increasing charging function. In the literature, the non-linear charging function is typically approximated by a piecewise linear charging ...
Arne Schulz
doaj   +1 more source

Twists of trigonometric sigma models

Journal of High Energy Physics
We introduce the ℤ N -twisted trigonometric sigma models, a new class of integrable deformations of the principal chiral model. Starting from 4d Chern-Simons theory on a cylinder, the models are constructed by introducing a ℤ N branch cut running along ...
Rashad Hamidi, Ben Hoare
doaj   +1 more source

Integer programming models and branch-and-cut approaches to generalized {0,1,2}-survivable network design problems. [PDF]

Comput Optim Appl, 2016
Leitner M.
europepmc   +1 more source

Cut and Count and representative sets on branch decompositions

, 2017
Recently, new techniques have been introduced to speed up dynamic programming algorithms on tree decompositions for connectivity problems: the 'Cut and Count' method and a method called the rank-based approach, based on representative sets and Gaussian elimination.
Pino, Willem J. A., Bodlaender, Hans L., van Rooij, Johan M. M.   +2 more
openaire   +5 more sources

Experimental observation of energy-band Riemann surface. [PDF]

Sci Adv
Cheng D, Wang H, Zhong J, Lustig E, Roques-Carmes C, Fan S.   +5 more
europepmc   +1 more source

Anatomical Study of the Angular Branch of the Thoracodorsal Artery and the Lateral Border of the Scapula With Application to Reconstructive Surgery. [PDF]

Cureus
Lesser ER, Samrid R, Pujol J, Bishop J, Rosbrugh J, Bubb KC, Raeburn KT, Barton BM, Iwanaga J, Tubbs RS.   +9 more
europepmc   +1 more source

Lithium-Ion Battery Pack Cycling Dataset with CC-CV Charging and WLTP/Constant Discharge Profiles. [PDF]

Sci Data
de la Vega Hernández J, Ortega-Redondo JA, Riba JR.   +2 more
europepmc   +1 more source

Cutting Trees and Piling Branches

Journal of African Studies, 1998
openaire   +2 more sources