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

DOI10.1007/978-3-319-59776-8_18zbMath1489.68246OpenAlexW2617454274MaRDI QIDQ2011594

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

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

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

Related Items (5)

Constraint programming and operations research ⋮ Exact solution of network flow models with strong relaxations ⋮ An exploratory computational analysis of dual degeneracy in mixed-integer programming ⋮ Four Good Reasons to Use an Interior Point Solver Within a MIP Solver ⋮ New exact techniques applied to a class of network flow formulations

Uses Software

• MIPLIB
• SIMPL

Cites Work

• Linear relaxations and reduced-Cost based propagation of continuous variable subscripts
• Cost based filtering for the constrained knapsack problem
• Solving TSP through the Integration of OR and CP Techniques
• An Integrated Solver for Optimization Problems
• Mixed Integer Programming Computation
• Pivot and Complement–A Heuristic for 0-1 Programming
• Principles and Practice of Constraint Programming – CP 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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