The following pages link to David Romero (Q299055):
Displayed 14 items.
- On the closest point to the origin in transportation polytopes (Q299056) (← links)
- Ad hoc heuristic for the cover printing problem (Q435726) (← links)
- New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture (Q503615) (← links)
- Embeddability of the combinohedron (Q1613559) (← links)
- A hybrid simulated annealing/linear programming approach for the cover printing problem (Q1721187) (← links)
- (Q1823137) (redirect page) (← links)
- Easy transportation-like problems on K-dimensional arrays (Q1823138) (← links)
- The dominance assignment problem (Q1926493) (← links)
- A simulated annealing approach for the train design optimization problem (Q1992782) (← links)
- The Erdős–Faber–Lovász conjecture is true for n ≤ 12 (Q2920887) (← links)
- Mechanisms for assessing and enhancing organisations’ readiness for collaboration in collaborative networks (Q3055327) (← links)
- (Q3070194) (← links)
- (Q3447292) (← links)
- (Q3905063) (← links)