Algorithmic expedients for the \(S\)-labeling problem

DOI10.1016/j.cor.2019.04.014zbMath1458.90626arXiv1909.04463OpenAlexW2972318496WikidataQ128116087 ScholiaQ128116087MaRDI QIDQ2003435

Markus Sinnl

Publication date: 8 July 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.04463

zbMATH Keywords

Lagrangian relaxationbranch-and-cutconstraint programminggraph labeling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Population-based iterated greedy algorithm for the S-labeling problem ⋮ A note on computational approaches for the antibandwidth problem

Uses Software

• NetworkX
• TScb
• SAcb

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tabu search for the cyclic bandwidth problem
• Algorithmic complexity of proper labeling problems
• The \(S\)-\textsc{labeling} problem: an algorithmic tour
• Branching rules revisited
• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
• Algorithmic Aspects of the S-Labeling Problem
• On the S-Labeling problem
• GRASP with path relinking heuristics for the antibandwidth problem
• Integer Programming
• A dual ascent approach for steiner tree problems on a directed graph
• Packing of (0, 1)-matrices
• A Dual-Based Procedure for Uncapacitated Facility Location
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Graph labeling and radio channel assignment
• Graph distance‐dependent labeling related to code assignment in computer networks
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• Mapping the genome

This page was built for publication: Algorithmic expedients for the \(S\)-labeling problem