Pages that link to "Item:Q1265901"

The following pages link to Integer programming approaches to facilities layout models with forbidden areas (Q1265901):

Displaying 8 items.

• Revisiting dynamic programming for finding optimal subtrees in trees (Q856203) (← links)
• The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
• Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← links)
• New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem (Q1764754) (← links)
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
• Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem (Q2434979) (← links)
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
• Constructing an optimal facility layout to maximize adjacency as a function of common boundary length (Q5058746) (← links)