Pages that link to "Item:Q1719620"

The following pages link to Benders decomposition for very large scale partial set covering and maximal covering location problems (Q1719620):

Displaying 21 items.

• Large-scale influence maximization via maximal covering location (Q2028806) (← links)
• Capacitated multi-period maximal covering location problem with server uncertainty (Q2029288) (← links)
• Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule (Q2030506) (← links)
• Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (Q2097628) (← links)
• A Benders decomposition algorithm for the maximum availability service facility location problem (Q2108127) (← links)
• Robust min-max regret covering problems (Q2162527) (← links)
• Discrete optimization methods for group model selection in compressed sensing (Q2235146) (← links)
• The incremental connected facility location problem (Q2329719) (← links)
• An accelerated Benders decomposition algorithm for solving a double-type double-standard maximal covering location problem (Q2661956) (← links)
• Minmax regret maximal covering location problems with edge demands (Q2668649) (← links)
• Benders decomposition for a node-capacitated virtual network function placement and routing problem (Q2668658) (← links)
• Benders decomposition for network design covering problems (Q2669611) (← links)
• Upgrading edges in the maximal covering location problem (Q2673553) (← links)
• Implementing Automatic Benders Decomposition in a Modern MIP Solver (Q5041736) (← links)
• The Star Degree Centrality Problem: A Decomposition Approach (Q5084632) (← links)
• 3-D Dynamic UAV Base Station Location Problem (Q5085461) (← links)
• New formulations for two location problems with interconnected facilities (Q6128897) (← links)
• Multi-type maximal covering location problems: hybridizing discrete and continuous problems (Q6167323) (← links)
• An efficient Benders decomposition for the \(p\)-median problem (Q6167396) (← links)
• Efficient presolving methods for solving maximal covering and partial set covering location problems (Q6168589) (← links)
• Math‐based reinforcement learning for the adaptive budgeted influence maximization problem (Q6196896) (← links)