The following pages link to (Q3059325):
Displaying 14 items.
- Algorithms for the partial inverse matroid problem in which weights can only be increased (Q312484) (← links)
- Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
- Some inverse optimization problems on network (Q394471) (← links)
- Partial inverse min-max spanning tree problem (Q830941) (← links)
- On inverse traveling salesman problems (Q1936660) (← links)
- Weighted inverse maximum perfect matching problems under the Hamming distance (Q1945512) (← links)
- Inverse optimization problems with multiple weight functions (Q2112661) (← links)
- Algorithm for constraint partial inverse matroid problem with weight increase forbidden (Q2629239) (← links)
- A simple algorithm and min-max formula for the inverse arborescence problem (Q2661220) (← links)
- Reverse maximum flow problem under the weighted Chebyshev distance (Q4634311) (← links)
- A Discrete Convex Min-Max Formula for Box-TDI Polyhedra (Q5085130) (← links)
- Maximum Capacity Path Interdiction Problem with Fixed Costs (Q5193217) (← links)
- Combinatorial algorithms for restricted inverse optimal value problems on minimum spanning tree under weighted \(l_1\) norm (Q6582067) (← links)
- Manipulating the outcome of stable marriage and roommates problems (Q6634129) (← links)
