Report
OA Policy
English

Semi-Lagrangian Relaxation

Collection

  • Cahiers de recherche; 2004.14

Publication date

2004

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

UNIGE affiliation entities

Citation (ISO format)

BELTRAN, C., TADONKI, Claude, VIAL, Jean-Philippe. Semi-Lagrangian Relaxation. 2004

Main files (1)

Report

Identifiers

  • PID : unige:5768
667views
1969downloads

Technical informations

Creation

15/04/2010 12:19:55

First validation

15/04/2010 12:19:55

Update

14/03/2023 15:26:30

Status update

14/03/2023 15:26:30

Last indexation

29/10/2024 14:22:29
All rights reserved by Archive ouverte UNIGE and the University of Geneva
OpenAIRE Indexed & Validated