A first look at picking dual variables for maximizing reduced cost fixing

DOI10.1007/978-3-319-59776-8_18MaRDI QIDQ2011594zbMATH OpenOpenAlexFDO

Authors Omid Sanei Bajgiran, Andre A. Cire, Louis-Martin Rousseau

Publication date 4 August 2017

Full work available at URL http://hdl.handle.net/1807/79001

zbMATH Keywords

mixed-integer programmingreduced-cost based filteringvariable fixing methodology

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mixed integer programming (90C11)

Recommendations

• Using dual presolving reductions to reformulate cumulative constraints
• Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben
• A dual heuristic for mixed integer programming
• Progress in presolving for mixed integer programming
• Dual variable based fathoming in dynamic programs for column generation

Cites work

• An integrated solver for optimization problems
• Cost based filtering for the constrained knapsack problem
• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 2080319 (Why is no real title available?)
• scientific article; zbMATH DE number 2086935 (Why is no real title available?)
• Linear relaxations and reduced-Cost based propagation of continuous variable subscripts
• MIP: Theory and practice -- closing the gap
• Mixed integer programming computation
• Pivot and Complement–A Heuristic for 0-1 Programming
• Principles and Practice of Constraint Programming – CP 2004
• Solving TSP through the integration of OR and CP techniques

Cited in

(9)

• Constraint programming and operations research
• New exact techniques applied to a class of network flow formulations
• An exploratory computational analysis of dual degeneracy in mixed-integer programming
• Exact solution of network flow models with strong relaxations
• Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
• Using dual presolving reductions to reformulate cumulative constraints
• Arc-consistency with linear programming reduced costs (applied to stable set in chordal graphs)
• On a geometric graph-covering problem related to optimal safety-landing-site location
• The theory of Lagrangian filtering zones: a case study on the knapsack constraint

Describes a project that uses

Uses Software

• MIPLIB
• SIMPL

This page was built for publication: A first look at picking dual variables for maximizing reduced cost fixing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011594)