Pages that link to "Item:Q1941390"

The following pages link to Tight compact models and comparative analysis for the prize collecting Steiner tree problem (Q1941390):

Displaying 11 items.

• Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles (Q336550) (← links)
• The coastal seaspace patrol sector design and allocation problem (Q395695) (← links)
• Risk models for the prize collecting Steiner tree problems with interval data (Q403434) (← links)
• Prize collecting Steiner trees with node degree dependent costs (Q709134) (← links)
• Algorithmic expedients for the prize collecting Steiner tree problem (Q1952504) (← links)
• Breakout local search for the Steiner tree problem with revenue, budget and hop constraints (Q2255904) (← links)
• Solving the selective multi-category parallel-servicing problem (Q2341388) (← links)
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
• Generating lower bounds for the prize collecting Steiner problem in graphs (Q2741469) (← links)
• Strength of three MIP formulations for the prize collecting Steiner tree problem with a quota constraint (Q2883603) (← links)
• Allocating nodes to hubs for minimizing the hubs processing resources: A case study (Q5242266) (← links)