IEEE

A fast Lagrangian relaxation algorithm for finding multi-constrained multiple shortest paths

Abstract: Finding a multi-constrained shortest path (MCSP) between a pair of nodes arises in many important applications such as quality of service provisioning in the next-generation network. While ...
IEEE

An improved iterative algorithm for ionospheric tomography reconstruction by using the automatic search technology of relaxation factor

Abstract: An improved ionospheric tomography algorithm is developed for the tomographic reconstruction of the ionospheric electron density distribution based on the automatic search technology of ...
Scientific Research Publishing

H. P. Benson, “An All-Linear Programming Relaxation Algorithm for Optimizing over the Efficient Set,” Journal of Global Optimization, Vol. 1, No. 1, 1991, pp. 83-104. doi ...

ABSTRACT: In this paper, we address bilevel multi-objective programming problems (BMPP) in which the decision maker at each level has multiple objective functions conflicting with each other. Given a ...
GitHub

TRAM: A Transverse Relaxation Time–Aware Qubit Mapping Algorithm for NISQ Devices

Noisy intermediate-scale quantum (NISQ) devices impose dual challenges on quantum circuit execution: limited qubit connectivity requires extensive SWAP-gate routing, while time-dependent decoherence ...
GitHub

Lagrangian Relaxation Algorithm for Network Revenue Management

This repository provides a public implementation of the Lagrangian Relaxation Algorithm for network revenue management, originally developed by Prof. Huseyin Topaloglu (2009). Researchers in ...