The following pages link to Zacharie Ales (Q325477):
Displayed 13 items.
- An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
- Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties (Q1652242) (← links)
- Compact MILP formulations for the \(p\)-center problem (Q1661850) (← links)
- Minimizing the weighted sum of completion times under processing time uncertainty (Q1742192) (← links)
- (Q2110401) (redirect page) (← links)
- Reinforcement learning for variable selection in a branch and bound algorithm (Q2110404) (← links)
- Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem (Q6047873) (← links)
- The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> (Q6092622) (← links)
- An efficient Benders decomposition for the \(p\)-median problem (Q6167396) (← links)
- Minimizing recovery cost of network optimization problems (Q6179707) (← links)
- On the polyhedron of the K-partitioning problem with representative variables (Q6256660) (← links)
- Compact MILP formulations for the $p$-center problem (Q6425930) (← links)