Active-constraint variable ordering for faster feasibility of mixed integer linear programs
From MaRDI portal
Publication:985305
DOI10.1007/S10107-006-0009-0zbMATH Open1205.90207OpenAlexW2068133968MaRDI QIDQ985305FDOQ985305
Publication date: 21 July 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0009-0
Recommendations
- A feasible active set method with reoptimization for convex quadratic mixed-integer programming
- Extended Active Constraints in Linear Optimization with Applications
- An efficient linearization approach for mixed-integer problems
- Active set algorithm for mathematical programs with linear complementarity constraints
- Faster integer-feasibility in mixed-integer linear programs by branching to force change
- Exact and fast algorithms for mixed-integer nonlinear programming
- Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming
- scientific article; zbMATH DE number 853656
- Order-constrained linear optimization
- Efficient global optimization of constrained mixed variable problems
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)
Cites Work
- Octane: A New Heuristic for Pure 0–1 Programs
- Benchmarking optimization software with performance profiles.
- A Computational Study of Search Strategies for Mixed Integer Programming
- An Automatic Method of Solving Discrete Programming Problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- The feasibility pump
- Exploring relaxation induced neighborhoods to improve MIP solutions
- A tree-search algorithm for mixed integer programming problems
- Surrogate Constraints
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs
- Experiments in mixed-integer linear programming
- Pivot and shift -- a mixed integer programming heuristic
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
- Tutorial on surrogate constraint approaches for optimization in graphs
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
- Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
- Investigation of some branch and bound strategies for the solution of mixed integer linear programs
- Experiments in mixed-integer linear programming using pseudo-costs
- Title not available (Why is that?)
Cited In (14)
- Faster MIP solutions via new node selection rules
- A computational study of parametric tabu search for 0-1 mixed integer programs
- Solution counting algorithms for constraint-centered search heuristics
- Branching on nonchimerical fractionalities
- Achieving MILP feasibility quickly using general disjunctions
- DASH: dynamic approach for switching heuristics
- The feasibility pump
- Faster integer-feasibility in mixed-integer linear programs by branching to force change
- Improving strong branching by domain propagation
- Minimal infeasible constraint sets in convex integer programs
- Information-based branching schemes for binary linear mixed integer problems
- Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization
- Solution Counting Algorithms for Constraint-Centered Search Heuristics
- Zero duality gap in surrogate constraint optimization: a concise review of models
Uses Software
This page was built for publication: Active-constraint variable ordering for faster feasibility of mixed integer linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985305)
