An exact approach for the minimum-cost bounded-error calibration tree problem

DOI10.1007/S10479-019-03443-4MaRDI QIDQ2178300zbMATH OpenOpenAlexFDO

Authors Iago A. Carvalho, Marco A. Ribeiro

Publication date 11 May 2020

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-019-03443-4

zbMATH Keywords

multiple objective programmingaugmented \(\epsilon\)-constraintscalibration errorspanning arborescencewireless sensors network

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35)

Recommendations

• The minimum cost hop-and-root constrained forest in wireless sensor networks
• The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm
• A branch-and-cut approach for the minimum-energy broadcasting problem in wireless networks
• Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
• Modeling and solving the bi-objective minimum diameter-cost spanning tree problem

Cites work

• scientific article; zbMATH DE number 1978145 (Why is no real title available?)
• A new scalar equivalence for Pareto optimization
• An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
• An energy consumption model for performance analysis of routing protocols for mobile ad hoc networks
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• Efficiency in multiple objective optimization problems
• Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Modeling and solving the rooted distance-constrained minimum spanning tree problem
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• On the analytical derivation of efficient sets in quad-and-higher criterion portfolio selection
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• Survey of multi-objective optimization methods for engineering

Cited in

(1)

• On solving bi-objective constrained minimum spanning tree problems

Describes a project that uses

Uses Software

• SPEA2

This page was built for publication: An exact approach for the minimum-cost bounded-error calibration tree problem

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