Pages that link to "Item:Q4628045"

The following pages link to Detecting critical node structures on graphs: A mathematical programming approach (Q4628045):

Displaying 7 items.

• Construction of simple path graphs in transport networks. I: General solutions and examples (Q1995394) (← links)
• Integer programming methods for solving binary interdiction games (Q2672065) (← links)
• Solving the Distance-Based Critical Node Problem (Q5087707) (← links)
• A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem (Q6068690) (← links)
• Polarization reduction by minimum‐cardinality edge additions: Complexity and integer programming approaches (Q6070501) (← links)
• The stochastic critical node problem over trees (Q6092626) (← links)
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)