Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
From MaRDI portal
Publication:4132253
Cited in
(63)- Enhanced-interval linear programming
- A branch-and-bound algorithm for 0-1 parametric mixed integer programming
- Aggregation of constraints in integer programming
- Marginal values in mixed integer linear programming
- An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem
- Optimal algorithms for sensitivity analysis in associative multiplication problems
- An algorithm for the multiple objective integer linear programming problem
- Parametric integer linear programming: A synthesis of branch and bound with cutting planes
- Parametric nonlinear integer programming: The right-hand side case
- A fuzzy set-theoretic method for public facility location
- A decomposition technique for mixed integer programming problems
- A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems
- A comment on ``Grey integer programming: an application to waste management planning under uncertainty by Guo H. Huang, Brian W. Baetz, Gilles G. Patry
- Structural approach to parametric analysis of an IP. On the case of the right-hand side
- Stability aspects of the traveling salesman problem based on \(k\)-best solutions
- A response to ``A comment on `Grey integer programming: an application to waste management planning under uncertainty{'} by Larry Jenkins
- A bi-objective uncapacitated facility location problem
- A contraction for the multiparametric integer linear programming problem
- Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study
- A procedure to verify the completeness of the right-hand-side parametric analysis for a mixed integer linear programming problem
- An algorithm for multiparametric mixed-integer linear programming problems
- Boolean programming problems with fuzzy constraints
- Parametric uncapacitated facility location
- An algorithm for the multiparametric 0--1-integer linear programming problem relative to the objective function
- An algorithm for the multiparametric 0-1-integer linear programming problem relative to the constraint matrix
- The multiparametric 0-1-integer linear programming problem: A unified approach
- An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program
- Optimizing high-level nuclear waste disposal within a deep geologic repository
- Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
- Some concepts of stability analysis in combinatorial optimization
- General approach to estimating the complexity of postoptimality analysis for discrete optimization problems
- Compact representation of near-optimal integer programming solutions
- Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities
- An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems
- The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price
- Parametric methods in integer linear programming
- Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
- Real-time personnel re-scheduling after a minor disruption in the retail industry
- Mixed integer parametric bilevel programming for optimal strategic bidding of energy producers in day-ahead electricity markets with indivisibilities
- Stability, parametric, and postoptimality analysis of discrete optimization problems
- An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function
- Postoptimal Analysis in Nonserial Dynamic Programming
- Solution of a parametric integer programming problem
- Theoretical and algorithmic advances in multi-parametric programming and control
- Certain parametric problems of integer convex programming and their approximate solution
- Analisis de estrategias en el ajuste lineal de funciones no-lineales en problemas de optimizacion
- Integer programming duality: Price functions and sensitivity analysis
- An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems
- On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems
- Multiple cost coefficients sensitivity theorems of integer linear optimization
- Maintaining perfect matchings at low cost
- An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- Parametric-objective integer programming using knapsack facets and Gomory cutting planes
- Fuzzy non-linear integer program by parametric programming approach
- An exact solution algorithm for integer bilevel programming with application in energy market optimization
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
- A survey of exact and approximation algorithms for linear-parametric optimization problems
- Efficient market-clearing prices in markets with nonconvexities
- Parameterisation algorithms for the integer linear programs in binary variables
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
- Low-complexity control of hybrid systems using approximate multi-parametric MILP
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter
This page was built for publication: Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132253)