Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

EOR
2008

favoriteEmaildiscussreport

85views more EOR 2008»

The Linear Ordering Problem with cumulative costs

13 years 4 months ago

The Linear Ordering Problem with cumulative costs

Download www.dei.unipd.it

Several optimization problems require finding a permutation of a given set of items that minimizes a certain cost function. These problems are naturally modelled in graph-theory terms by introducing a complete digraph G = (V, A) whose vertices v V := {1,

Livio Bertacco, Lorenzo Brunetta, Matteo Fischetti

Real-time Traffic

Cost Function | EOR 2008 | Optimization Problems | Permutation |

claim paper

Related Content

» A branchandbound algorithm for the linear ordering problem with cumulative costs

» Planning and Scheduling by LogicBased Benders Decomposition

» A Hybrid Method for Planning and Scheduling

» Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems

» Detachable Object Detection Segmentation and Depth Ordering from ShortBaseline Video

» Note An application of the EOQ model with nonlinear holding cost to inventory management o...

» Linearly Parameterized Bandits

» Blind identification of MISOFIR channels

» CostSensitive Parsimonious Linear Regression

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	EOR
Authors	Livio Bertacco, Lorenzo Brunetta, Matteo Fischetti

Comments (0)