The following pages link to Anand Subramanian (Q247857):
Displayed 41 items.
- A matheuristic approach for the pollution-routing problem (Q319140) (← links)
- A speed and departure time optimization algorithm for the pollution-routing problem (Q320086) (← links)
- On solving manufacturing cell formation via bicluster editing (Q323416) (← links)
- Improved bounds for large scale capacitated arc routing problem (Q336459) (← links)
- A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
- An iterated local search heuristic for the split delivery vehicle routing problem (Q337288) (← links)
- Hybrid metaheuristics for the clustered vehicle routing problem (Q337513) (← links)
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery (Q376001) (← links)
- Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery (Q408394) (← links)
- Branch-and-cut approaches for \(p\)-cluster editing (Q505422) (← links)
- Item:Q247857 (redirect page) (← links)
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery (Q976005) (← links)
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem (Q1652142) (← links)
- Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times (Q1652166) (← links)
- Corrigendum to: ``Hybrid metaheuristics for the clustered vehicle routing problem'' (Q1652368) (← links)
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times (Q1652516) (← links)
- The static bike relocation problem with multiple vehicles and visits (Q1681499) (← links)
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet (Q1730643) (← links)
- A hybrid iterated local search heuristic for the maximum weight independent set problem (Q1749784) (← links)
- New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
- Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times (Q1754111) (← links)
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem (Q1926856) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- Branch-and-price for \(p\)-cluster editing (Q2013143) (← links)
- A simple and effective hybrid genetic search for the job sequencing and tool switching problem (Q2027021) (← links)
- A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints (Q2029253) (← links)
- Integer programming formulations and efficient local search for relaxed correlation clustering (Q2052402) (← links)
- On the exact solution of vehicle routing problems with backhauls (Q2189917) (← links)
- On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
- Solution strategies for the vehicle routing problem with backhauls (Q2228411) (← links)
- Conference scheduling: a clustering-based approach (Q2242187) (← links)
- Exact algorithms for the traveling salesman problem with draft limits (Q2256207) (← links)
- A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks (Q2270094) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem (Q2668616) (← links)
- A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem (Q2960368) (← links)
- Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling (Q5087720) (← links)
- Efficient algorithms for cluster editing (Q5963626) (← links)
- Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows (Q6164607) (← links)
- A simple and effective hybrid genetic search for the job sequencing and tool switching problem (Q6327686) (← links)
- Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem (Q6372548) (← links)