The following pages link to Algorithms - ESA 2003 (Q5897287):
Displaying 11 items.
- A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem (Q1651621) (← links)
- Algorithmic expedients for the prize collecting Steiner tree problem (Q1952504) (← links)
- An exact method for assortment optimization under the nested logit model (Q2030643) (← links)
- Exact approaches for solving robust prize-collecting Steiner tree problems (Q2355891) (← links)
- Complexity and approximation for traveling salesman problems with profits (Q2441781) (← links)
- Approximating a class of combinatorial problems with rational objective function (Q2638374) (← links)
- A sixth bibliography of fractional programming (Q3426331) (← links)
- Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
- Variations of the prize‐collecting Steiner tree problem (Q5487807) (← links)
- Solving the probabilistic profitable tour problem on a line (Q6081600) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
