Pages that link to "Item:Q2072063"
From MaRDI portal
The following pages link to On the complexity of solution extension of optimization problems (Q2072063):
Displaying 11 items.
- On complexity of a global optimization problem (Q928586) (← links)
- On the complexity of optimization over the standard simplex (Q932197) (← links)
- On the complexity of the extreme points decision problem (Q1183448) (← links)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- In memory of Jérôme Monnot (Q2140557) (← links)
- On Residual Approximation in Solution Extension Problems (Q2958338) (← links)
- On the Hardness of Reoptimization with Multiple Given Solutions (Q3100925) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6043174) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes (Q6145807) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6547209) (← links)