Pages that link to "Item:Q3612404"
From MaRDI portal
The following pages link to Connections in Networks: Hardness of Feasibility Versus Optimality (Q3612404):
Displaying 10 items.
- The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences (Q320748) (← links)
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes (Q505972) (← links)
- Connection problems in mountains and monotonic allocation schemes. (Q699516) (← links)
- Feasibility in capacitated networks: The effect of individual arcs and nodes (Q1380444) (← links)
- Optimal connected subgraphs: Integer programming formulations and polyhedra (Q6064164) (← links)
- The min-Knapsack problem with compactness constraints and applications in statistics (Q6069243) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem (Q6164361) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)
- Wildlife reserve design with connectivity and buffer requirements (Q6195027) (← links)