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

DOI10.1016/J.ADVENGSOFT.2009.12.017zbMATH Open1187.65070OpenAlexW2063486741MaRDI QIDQ964367FDOQ964367

Authors Ali Naimi Sadigh, Marzieh Mozafari, Ali Husseinzadeh Kashan

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 examplesfacility locationheuristic algorithmtabu searchcomplementary edge covering problemmixed integer linear model

Mathematics Subject Classification ID

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

Recommendations

• The Covering Tour Problem
• An integer programming-based local search for the covering salesman problem
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks
• Enumeration technique for set covering problems: a combinatorial approach
• The multicovering problem

Cites work

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

Cited in

(3)

• On covering location problems on networks with edge demand
• Covering edges in networks
• Edge covering problem under hybrid uncertain environments

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q964367)