نتایج جستجو برای: capacitated allocation

تعداد نتایج: 82590  

Journal: :Transportation Science 2013
Tobias Harks Felix G. König Jannik Matuschke

A approximation algorithm for an optimization problem runs in polynomial time for all instances and is guaranteed to deliver solutions with bounded optimality gap. We derive such algorithms for different variants of capacitated location routing, an important generalization of vehicle routing where the cost of opening the depots from which vehicles operate is taken into account. Our results orig...

Journal: :Reproductive biology 2005
Margarita Mollova Maria Ivanova Boyko Atanasov Malcho Petrov Stanimir Kuyrkchiev

The Mab 4B12 produced by us against capacitated boar spermatozoa was found to recognize a protein located in the acrosome portion of capacitated boar spermatozoa which is shared by different animal species, dogs included. It was shown that Mab 4B12 might affect fertilizing ability in vitro of boar spermatozoa. Using indirect immunofluorescence (IIF) test, we provide evidence here that Mab 4B12 ...

Journal: :Discrete Optimization 2014
Mads Jepsen Bjørn Petersen Simon Spoorendonk David Pisinger

A branch-and-cut algorithm for the capacitated profitable tour problem.

Journal: :Discrete Applied Mathematics 2015
Daniel Cosmin Porumbel Gilles Goncalves

In cutting and packing problems, Dual Feasible Functions (DFFs) represent a well established tool for deriving high quality lower bounds in very short times. A well-known DFF lower bounding approach consists of using DFFs to rapidly generate feasible values for the dual variables of a Column Generation (CG) program (i.e., of an extended formulation commonly associated to CG). This paper present...

Journal: :Inf. Process. Lett. 2006
Xianchao Zhang Weifa Liang He Jiang

Given an edge-capacitated undirected graph G = (V ,E,C) with edge capacity c :E → R+, n = |V |, an s − t edge cut C of G is a minimal subset of edges whose removal from G will separate s from t in the resulting graph, and the capacity sum of the edges in C is the cut value of C. A minimum s − t edge cut is an s − t edge cut with the minimum cut value among all s − t edge cuts. A theorem given b...

Journal: :Transportation Science 2016
Mauro Dell'Amico José Carlos Díaz Díaz Geir Hasle Manuel Iori

We study the Mixed Capacitated General Routing Problem (MCGRP) in which a fleet of capacitated vehicles has to serve a set of requests by traversing a mixed weighted graph. The requests may be located on nodes, edges, and arcs. The problem has theoretical interest because it is a generalization of the Capacitated Vehicle Routing Problem (CVRP), the Capacitated Arc Routing Problem (CARP), and th...

Journal: :Oper. Res. Lett. 2003
Ravindra K. Ahuja James B. Orlin Dushyant Sharma

The capacitated minimum spanning tree (CMST) problem is to 3nd a minimum cost spanning tree in a network where nodes have speci3ed demands, with an additional capacity constraints on the subtrees incident to a given source node s. The capacitated minimum spanning tree problem arises as an important subproblem in many telecommunication network design problems. In a recent paper, Ahuja et al. (Ma...

Journal: :Oper. Res. Lett. 2005
András Frank Zoltán Király Balázs Kotnyek

A strongly polynomial time algorithm is described to solve the node-capacitated routing problem in an undirected ring network.

Journal: :Discrete & Computational Geometry 2019

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید