### Abstract

We apply to fixed charge network flow (FCNF) problems a general hybrid solution method that combines constraint programming and linear programming. FCNF problems test the hybrid approach on problems that are already rather well suited for a classical 0-1 model. They are solved by means of a global constraint that generates specialized constraint propagation algorithms and a projected relaxation that can be rapidly solved as a minimum cost network flow problem. The hybrid approach ran about twice as fast as a commercial mixed integer programming code on fixed charge transportation problems with its advantage increasing with problem size. For general fixed charge transshipment problems, however, it has no effect because the implemented propagation methods are weak.

Original language | English |
---|---|

Pages (from-to) | 95-124 |

Number of pages | 30 |

Journal | Annals of Operations Research |

Volume | 115 |

Issue number | 1-4 |

DOIs | |

Publication status | Published - 2002 Dec 1 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Decision Sciences(all)
- Management Science and Operations Research

### Cite this

*Annals of Operations Research*,

*115*(1-4), 95-124. https://doi.org/10.1023/A:1021145103592

}

*Annals of Operations Research*, vol. 115, no. 1-4, pp. 95-124. https://doi.org/10.1023/A:1021145103592

**Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach.** / Kim, Hak Jin; Hooker, John N.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach

AU - Kim, Hak Jin

AU - Hooker, John N.

PY - 2002/12/1

Y1 - 2002/12/1

N2 - We apply to fixed charge network flow (FCNF) problems a general hybrid solution method that combines constraint programming and linear programming. FCNF problems test the hybrid approach on problems that are already rather well suited for a classical 0-1 model. They are solved by means of a global constraint that generates specialized constraint propagation algorithms and a projected relaxation that can be rapidly solved as a minimum cost network flow problem. The hybrid approach ran about twice as fast as a commercial mixed integer programming code on fixed charge transportation problems with its advantage increasing with problem size. For general fixed charge transshipment problems, however, it has no effect because the implemented propagation methods are weak.

AB - We apply to fixed charge network flow (FCNF) problems a general hybrid solution method that combines constraint programming and linear programming. FCNF problems test the hybrid approach on problems that are already rather well suited for a classical 0-1 model. They are solved by means of a global constraint that generates specialized constraint propagation algorithms and a projected relaxation that can be rapidly solved as a minimum cost network flow problem. The hybrid approach ran about twice as fast as a commercial mixed integer programming code on fixed charge transportation problems with its advantage increasing with problem size. For general fixed charge transshipment problems, however, it has no effect because the implemented propagation methods are weak.

UR - http://www.scopus.com/inward/record.url?scp=0036439218&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036439218&partnerID=8YFLogxK

U2 - 10.1023/A:1021145103592

DO - 10.1023/A:1021145103592

M3 - Article

VL - 115

SP - 95

EP - 124

JO - Annals of Operations Research

JF - Annals of Operations Research

SN - 0254-5330

IS - 1-4

ER -