The following pages link to Eduardo G. Pardo (Q339557):
Displaying 17 items.
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems (Q887201) (← links)
- Variable neighborhood search strategies for the order batching problem (Q1652118) (← links)
- A variable neighborhood search approach for the crew pairing problem (Q1687651) (← links)
- General variable neighborhood search for the order batching and sequencing problem (Q1695017) (← links)
- GRASP with variable neighborhood descent for the online order batching problem (Q2022211) (← links)
- Multistart search for the cyclic cutwidth minimization problem (Q2026984) (← links)
- On solving the order processing in picking workstations (Q2070114) (← links)
- A general variable neighborhood search for the cyclic antibandwidth problem (Q2114825) (← links)
- Embedding signed graphs in the line (Q2253962) (← links)
- General variable neighborhood search applied to the picking process in a warehouse (Q2631231) (← links)
- A variable neighbourhood search approach to the cutwidth minimization problem (Q2840754) (← links)
- Parallel variable neighborhood search for the min–max order batching problem (Q5278230) (← links)
- Parallel variable neighbourhood search strategies for the cutwidth minimization problem (Q5382675) (← links)
- Order batching problems: taxonomy and literature review (Q6087522) (← links)
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem (Q6106765) (← links)
- General variable neighborhood search for the optimization of software quality (Q6561228) (← links)
