Pages that link to "Item:Q1278995"
From MaRDI portal
The following pages link to Using an interior point method for the master problem in a decomposition approach (Q1278995):
Displaying 9 items.
- An interior point cutting plane heuristic for mixed integer programming (Q632679) (← links)
- Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull (Q814963) (← links)
- Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem (Q849087) (← links)
- Design and implementation of a modular interior-point solver for linear optimization (Q2062319) (← links)
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
- Lagrangian relaxation based algorithm for trigeneration planning with storages (Q2469600) (← links)
- A linear model for compound multicommodity network flow problems (Q2654399) (← links)
- Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing (Q2830758) (← links)
- Interior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation Therapy (Q5067430) (← links)
