The following pages link to Edna A. Hoshino (Q324830):
Displaying 12 items.
- The ring tree facility location problem (Q324831) (← links)
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms (Q1683123) (← links)
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem (Q1759849) (← links)
- Heuristic approaches to the distinguishing substring selection problem (Q1791942) (← links)
- A branch-and-price algorithm for the ring-tree facility location problem (Q2132327) (← links)
- A branch-and-price approach for the partition coloring problem (Q2275580) (← links)
- Capacitated ring arborescence problems with profits (Q2284638) (← links)
- LP-based heuristics for the distinguishing string and substring selection problems (Q2675721) (← links)
- A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem (Q2840522) (← links)
- The minimum cut cover problem (Q2840718) (← links)
- Column Generation Algorithms for the Capacitated m-Ring-Star Problem (Q3511375) (← links)
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802) (← links)
