2015
DOI: 10.1016/j.dam.2014.05.017
|View full text |Cite
|
Sign up to set email alerts
|

Using dual feasible functions to construct fast lower bounds for routing and location problems

Abstract: 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 presents a method for extending this approach to problems such as Capacitated p-Median, Distance Constrained General Routing … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
references
References 30 publications
0
0
0
Order By: Relevance