Pages that link to "Item:Q3332777"
From MaRDI portal
The following pages link to Three methods for postoptimal analysis in integer linear programming (Q3332777):
Displayed 17 items.
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← links)
- Approximating the stability region for binary mixed-integer programs (Q833592) (← links)
- A shadow price in integer programming for management decision (Q1107446) (← links)
- An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem (Q1124717) (← links)
- A contraction for the multiparametric integer linear programming problem (Q1278945) (← links)
- A procedure to verify the completeness of the right-hand-side parametric analysis for a mixed integer linear programming problem (Q1296805) (← links)
- Average shadow prices in mathematical programming (Q1321203) (← links)
- Stability analysis for a special interval cutting problem (Q1390272) (← links)
- An algorithm for the multiparametric 0--1-integer linear programming problem relative to the objective function (Q1578554) (← links)
- An algorithm for the multiparametric 0-1-integer linear programming problem relative to the constraint matrix (Q1591599) (← links)
- The multiparametric 0-1-integer linear programming problem: A unified approach (Q1598718) (← links)
- An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program (Q1600931) (← links)
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem (Q1761937) (← links)
- Compact representation of near-optimal integer programming solutions (Q2191768) (← links)
- Parametric methods in integer linear programming (Q2639777) (← links)
- Multiple cost coefficients sensitivity theorems of integer linear optimization (Q5039396) (← links)
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1 (Q5479833) (← links)