Pages that link to "Item:Q2890417"
From MaRDI portal
The following pages link to Generalized networks: the theory of preprocessing and an empirical analysis (Q2890417):
Displaying 6 items.
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems (Q1681134) (← links)
- Presolving in linear programming (Q1914076) (← links)
- Preprocessing in Stochastic Programming: The Case of Uncapacitated Networks (Q4020662) (← links)
- (Q5143981) (← links)
- On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem (Q5191123) (← links)
- Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis (Q6496345) (← links)