Pages that link to "Item:Q2575571"
From MaRDI portal
The following pages link to Some inverse optimization problems under the Hamming distance (Q2575571):
Displaying 38 items.
- Capacity inverse minimum cost flow problems under the weighted Hamming distance (Q315493) (← links)
- Some inverse optimization problems on network (Q394471) (← links)
- Inverse 1-median problem on trees under weighted Hamming distance (Q445338) (← links)
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm (Q486731) (← links)
- On the Hamming distance in combinatorial optimization problems on hypergraph matchings (Q601985) (← links)
- Inverse scheduling: Two-machine flow-shop problem (Q640308) (← links)
- Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector (Q723499) (← links)
- Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm (Q883285) (← links)
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance (Q1029667) (← links)
- Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance (Q1034103) (← links)
- Inverse scheduling with maximum lateness objective (Q1041341) (← links)
- Inverse 1-center location problems with edge length augmentation on trees (Q1044223) (← links)
- An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance (Q1670106) (← links)
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector (Q1685587) (← links)
- Inverse multi-objective shortest pPath problem under the bottleneck type weighted Hamming distance (Q1698754) (← links)
- On inverse linear programming problems under the bottleneck-type weighted Hamming distance (Q1707916) (← links)
- On inverse traveling salesman problems (Q1936660) (← links)
- Weighted inverse maximum perfect matching problems under the Hamming distance (Q1945512) (← links)
- Inverse minimum flow problem under the weighted sum-type Hamming distance (Q2012059) (← links)
- Constrained inverse minimum flow problems under the weighted Hamming distance (Q2049978) (← links)
- Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector (Q2089873) (← links)
- Using inverse optimization to learn cost functions in generalized Nash games (Q2146979) (← links)
- Computation of inverse 1-center location problem on the weighted trapezoid graphs (Q2212218) (← links)
- Inverse maximum flow problems under the weighted Hamming distance (Q2385473) (← links)
- Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance (Q2494303) (← links)
- Inverse min-max spanning \(r\)-arborescence problem under the weighted sum-type Hamming distance (Q2818313) (← links)
- Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance (Q3225072) (← links)
- (Q3466910) (← links)
- A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE (Q3503010) (← links)
- Some Inverse Traveling Salesman Problems (Q3503524) (← links)
- Characteristics of the Distribution of Hamming Distance Values Between Multidimensional Assignment Problem Solutions (Q3564138) (← links)
- On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance (Q4626658) (← links)
- Reverse maximum flow problem under the weighted Chebyshev distance (Q4634311) (← links)
- Efficient algorithms for the reverse shortest path problem on trees under the hamming distance (Q4987673) (← links)
- Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks (Q5013391) (← links)
- Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance (Q5085261) (← links)
- Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network (Q5119373) (← links)
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions (Q6056893) (← links)