Some inverse optimization problems under the Hamming distance
From MaRDI portal
Publication:2575571
DOI10.1016/J.EJOR.2004.07.059zbMATH Open1091.90065OpenAlexW2154242276MaRDI QIDQ2575571FDOQ2575571
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
Recommendations
- Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
- Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance
- Inverse constrained minimum spanning tree problem under Hamming distance
- A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
- scientific article
Combinatorial optimization (90C27) Inverse problems in optimal control (49N45) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- A note on two problems in connexion with graphs
- Title not available (Why is that?)
- A data structure for dynamic trees
- The complexity analysis of the inverse center location problem
- Inverse Optimization
- On an instance of the inverse shortest paths problem
- Weighted inverse minimum spanning tree problems under Hamming distance
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- Computation of the reverse shortest-path problem
- A Faster Algorithm for the Inverse Spanning Tree Problem
- Two general methods for inverse optimization problems
- Solving inverse spanning tree problems through network flow techniques
- Minimum deviation and balanced optimization: A unified approach
- Inverse optimization in high-speed networks
- Modifying edges of a network to obtain short subgraphs
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
Cited In (31)
- Some inverse optimization problems on network
- Computation of inverse 1-center location problem on the weighted trapezoid graphs
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance
- Inverse scheduling with maximum lateness objective
- Title not available (Why is that?)
- Characteristics of the Distribution of Hamming Distance Values Between Multidimensional Assignment Problem Solutions
- On inverse linear programming problems under the bottleneck-type weighted Hamming distance
- Inverse minimum flow problem under the weighted sum-type Hamming distance
- Efficient algorithms for the reverse shortest path problem on trees under the hamming distance
- Inverse 1-median problem on trees under weighted Hamming distance
- A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
- Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector
- Inverse 1-center location problems with edge length augmentation on trees
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
- Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks
- Capacity inverse minimum cost flow problems under the weighted Hamming distance
- Some Inverse Traveling Salesman Problems
- Using inverse optimization to learn cost functions in generalized Nash games
- Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
- Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance
- 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
- Constrained inverse minimum flow problems under the weighted Hamming distance
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
- Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance
- Computing and Combinatorics
- Reverse maximum flow problem under the weighted Chebyshev distance
- Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector
- Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
- Inverse scheduling: Two-machine flow-shop problem
This page was built for publication: Some inverse optimization problems under the Hamming distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575571)
