A mixed integer linear program and tabu search approach for the complementary edge covering problem

DOI10.1016/J.ADVENGSOFT.2009.12.017zbMath1187.65070OpenAlexW2063486741MaRDI QIDQ964367

Ali Husseinzadeh Kashan, Ali Naimi Sadigh, Marzieh Mozafari

Publication date: 15 April 2010

Published in: Advances in Engineering Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.advengsoft.2009.12.017

zbMATH Keywords

numerical examplestabu searchfacility locationheuristic algorithmcomplementary edge covering problemmixed integer linear model

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05)

Related Items (2)

On covering location problems on networks with edge demand ⋮ Covering edges in networks

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks
• Neural networks and graph theory
• A GRASP algorithm to solve the unicost set covering problem
• Location coverage models with demand originating from nodes and paths: Application to cellular network design
• Computational experience with general cutting planes for the set covering problem
• Fuzzy minimum weight edge covering problem
• A genetic algorithm for the set covering problem
• Facility location with dynamic distance functions
• A Lagrangian-based heuristic for large-scale set covering problems
• A neural network for the minimum set covering problem
• A parallel genetic algorithm to solve the set-covering problem
• Future paths for integer programming and links to artificial intelligence
• A maximal covering location model in the presence of partial coverage
• Experimental analysis of approximation algorithms for the vertex cover and set covering problems
• A defensive maximal covering problem on a network
• Approximation Algorithms for Edge-Covering Problem
• Solving an ambulance location model by tabu search
• A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
• Capacitated vertex covering
• An indirect genetic algorithm for set covering problems
• Note: A local-search heuristic for large set-covering problems
• An exact algorithm for the maximal covering problem
• A column generation approach for the maximal covering location problem
• The Location of Emergency Service Facilities

This page was built for publication: A mixed integer linear program and tabu search approach for the complementary edge covering problem