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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Future paths for integer programming and links to artificial intelligence
• A genetic algorithm for the set covering problem
• A defensive maximal covering problem on a network
• Title not available (Why is that?)
• The Location of Emergency Service Facilities
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks
• A maximal covering location model in the presence of partial coverage
• Title not available (Why is that?)
• Capacitated vertex covering
• Title not available (Why is that?)
• Solving an ambulance location model by tabu search
• A Lagrangian-based heuristic for large-scale set covering problems
• A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
• Title not available (Why is that?)
• Note: A local-search heuristic for large set-covering problems
• A GRASP algorithm to solve the unicost set covering problem
• An exact algorithm for the maximal 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
• An indirect genetic algorithm for set covering problems
• A column generation approach for the maximal covering location problem
• Fuzzy minimum weight edge covering problem
• A parallel genetic algorithm to solve the set-covering problem
• Approximation Algorithms for Edge-Covering Problem
• Experimental analysis of approximation algorithms for the vertex cover and set covering problems
• Facility location with dynamic distance functions
• A neural network for the minimum set covering problem
• Neural networks and graph theory

Cited In (3)

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

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)