Pages that link to "Item:Q2468473"

The following pages link to Lagrangean relaxation with clusters for point-feature cartographic label placement problems (Q2468473):

Displaying 13 items.

• The disruptive anti-covering location problem (Q320083) (← links)
• A column generation approach for the unconstrained binary quadratic programming problem (Q439327) (← links)
• A decomposition heuristic for the maximal covering location problem (Q606191) (← links)
• Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem (Q875414) (← links)
• A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem (Q991376) (← links)
• POPMUSIC for the point feature label placement problem (Q1011166) (← links)
• A decomposition approach for the probabilistic maximal covering location-allocation problem (Q1017444) (← links)
• A Lagrangean decomposition for the maximum independent set problem applied to map labeling (Q2359523) (← links)
• Improved mathematical model and bounds for the crop rotation scheduling problem with adjacency constraints (Q2424771) (← links)
• Column generation approach for the point-feature cartographic label placement problem (Q2427437) (← links)
• A clustering search metaheuristic for the point-feature cartographic label placement problem (Q2514783) (← links)
• (Q2766843) (← links)
• A hybrid data mining heuristic to solve the point‐feature cartographic label placement problem (Q6069739) (← links)