Pages that link to "Item:Q3593375"

The following pages link to Locating a cycle in a transportation or a telecommunications network (Q3593375):

Displaying 19 items.

• Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
• A hybrid algorithm for the DNA sequencing problem (Q406500) (← links)
• The orienteering problem: a survey (Q617509) (← links)
• The traveling purchaser problem with stochastic prices: exact and approximate algorithms (Q621973) (← links)
• Tight bounds from a path based formulation for the tree of hub location problem (Q833527) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• Extensive facility location problems on networks: an updated review (Q1667394) (← links)
• Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms (Q1683123) (← links)
• Median and covering location problems with interconnected facilities (Q1738812) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• Variable neighbourhood structures for cycle location problems (Q1926979) (← links)
• Cooperation of customers in traveling salesman problems with profits (Q2191292) (← links)
• The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
• Insertion heuristics for central cycle problems (Q3057168) (← links)
• On path-bridge inequalities for the orienteering arc routing problems (Q5151530) (← links)
• Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth (Q5326798) (← links)
• Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures (Q6109290) (← links)
• New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802) (← links)