en
Report
Open access
English

Semi-Lagrangian Relaxation

Collection
  • Cahiers de recherche; 2004.14
Publication date2004
Abstract

Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used in (linear) combinatorial optimization with equality constraints generates an optimal intinteger solution. We call this new concept semi-Lagrangian relaxation and illustrate its practical value by solving large-scale instances of the p-median problem.

Keywords
  • Lagrangian relaxation
  • Combinatorial optimization
  • P-median problem
  • Proximal ACCPM
Citation (ISO format)
BELTRAN, C., TADONKI, Claude, VIAL, Jean-Philippe. Semi-Lagrangian Relaxation. 2004
Main files (1)
Report
accessLevelPublic
Identifiers
  • PID : unige:5768
558views
1816downloads

Technical informations

Creation04/15/2010 12:19:55 PM
First validation04/15/2010 12:19:55 PM
Update time03/14/2023 3:26:30 PM
Status update03/14/2023 3:26:30 PM
Last indexation01/15/2024 7:43:12 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack