Pages that link to "Item:Q1069859"
From MaRDI portal
The following pages link to Finiteness in restricted simplicial decomposition (Q1069859):
Displayed 11 items.
- A conjugate gradient projection algorithm for the traffic assignment problem (Q597403) (← links)
- Column generation algorithms for nonlinear optimization. II: Numerical investigations (Q609805) (← links)
- Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259) (← links)
- The convergence conditions of diagonalization and projection methods for fixed demand asymmetric network equilibrium problems (Q1083021) (← links)
- Bilevel programming in traffic planning: Models, methods and challenge (Q1913607) (← links)
- Restricted simplicial decomposition for convex constrained problems (Q2366609) (← links)
- D-optimal design of a monitoring network for parameter estimation of distributed systems (Q2454730) (← links)
- A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems (Q4000924) (← links)
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis (Q4430668) (← links)
- Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems (Q4695015) (← links)
- A scenario-based stochastic programming approach for technology and capacity planning (Q5959372) (← links)