Pages that link to "Item:Q337483"

The following pages link to A hybrid method for the probabilistic maximal covering location-allocation problem (Q337483):

Displaying 16 items.

• A hybrid of max-min ant system and linear programming for the \(k\)-covering problem (Q342539) (← links)
• A VNS-LP algorithm for the robust dynamic maximal covering location problem (Q1642060) (← links)
• An exact approach for the \(r\)-interdiction covering problem with fortification (Q1725826) (← links)
• The multi-pickup and delivery problem with time windows (Q1744529) (← links)
• Sequential versus integrated optimization: production, location, inventory control, and distribution (Q1754314) (← links)
• A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem (Q1955409) (← links)
• Solving a two-stage stochastic capacitated location-allocation problem with an improved PSO in emergency logistics (Q1993007) (← links)
• Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
• A separation based optimization approach to dynamic maximal covering location problems with switched structure (Q2031365) (← links)
• A matheuristic approach to large-scale avionic scheduling (Q2241154) (← links)
• Hybrid metaheuristic method for determining locations for long-term health care facilities (Q2347594) (← links)
• The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times (Q2664350) (← links)
• Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order (Q2669495) (← links)
• A survey of adaptive large neighborhood search algorithms and applications (Q2676311) (← links)
• The Maximal Expected Covering Location Problem: Revisited (Q3035112) (← links)
• A practical heuristic for maximum coverage in large-scale continuous location problem (Q5080078) (← links)