The following pages link to Decomposing Matrices into Blocks (Q4229489):
Displaying 25 items.
- A-priori upper bounds for the set covering problem (Q271942) (← links)
- A model-based approach and analysis for multi-period networks (Q353173) (← links)
- Revisiting dynamic programming for finding optimal subtrees in trees (Q856203) (← links)
- Packing and partitioning orbitopes (Q925263) (← links)
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
- New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem (Q1764754) (← links)
- Branching rules revisited (Q1886796) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- A branch-and-price algorithm for capacitated hypergraph vertex separation (Q2175443) (← links)
- A decomposition heuristic for mixed-integer supply chain problems (Q2183192) (← links)
- On integer and bilevel formulations for the \(k\)-vertex cut problem (Q2195678) (← links)
- A decomposition-based approach for the multiperiod multiproduct distribution planning problem (Q2336751) (← links)
- The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← 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)
- Improving strong branching by domain propagation (Q2513744) (← links)
- Automatic Dantzig-Wolfe reformulation of mixed integer programs (Q2515047) (← links)
- Exact algorithms for the vertex separator problem in graphs (Q3008917) (← links)
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
- Structure Detection in Mixed-Integer Programs (Q5136081) (← links)
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs (Q5219296) (← links)
- Disconnecting graphs by removing vertices: a polyhedral approach (Q5422013) (← links)
- Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming (Q5864669) (← links)
- High-multiplicity \(N\)-fold IP via configuration LP (Q6044979) (← links)