Some inverse optimization problems under the Hamming distance

DOI10.1016/j.ejor.2004.07.059zbMath1091.90065OpenAlexW2154242276MaRDI QIDQ2575571

A. Volgenant, Cees W. Duin

Publication date: 5 December 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.07.059

zbMATH Keywords

shortest pathcombinatorial optimizationminimum spanning treeinverse optimizationlinear assignment

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80) Inverse problems in optimal control (49N45)

Related Items

Capacity inverse minimum cost flow problems under the weighted Hamming distance, Using inverse optimization to learn cost functions in generalized Nash games, Inverse maximum flow problems under the weighted Hamming distance, An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance, Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm, Some inverse optimization problems on network, Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector, Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance, Initialization of metaheuristics: comprehensive review, critical analysis, and research directions, A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE, Inverse scheduling: Two-machine flow-shop problem, On inverse linear programming problems under the bottleneck-type weighted Hamming distance, Inverse 1-median problem on trees under weighted Hamming distance, Computation of inverse 1-center location problem on the weighted trapezoid graphs, Reverse maximum flow problem under the weighted Chebyshev distance, Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm, Inverse minimum flow problem under the weighted sum-type Hamming distance, Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector, Constrained inverse minimum flow problems under the weighted Hamming distance, Constrained inverse min-max spanning tree problems under the weighted Hamming distance, Efficient algorithms for the reverse shortest path problem on trees under the hamming distance, Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance, Inverse scheduling with maximum lateness objective, Inverse 1-center location problems with edge length augmentation on trees, Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector, Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Minimum deviation and balanced optimization: A unified approach
• The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
• On an instance of the inverse shortest paths problem
• Modifying edges of a network to obtain short subgraphs
• On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
• Inverse optimization in high-speed networks
• Weighted inverse minimum spanning tree problems under Hamming distance
• Two general methods for inverse optimization problems
• Computation of the reverse shortest-path problem
• The complexity analysis of the inverse center location problem
• A data structure for dynamic trees
• Solving Inverse Spanning Tree Problems Through Network Flow Techniques
• Inverse Optimization
• A Faster Algorithm for the Inverse Spanning Tree Problem