Active-Constraint Variable Ordering Schemes for Faster Feasibility of Mixed Integer Linear Programs

doi 10.22215/etd/2002-05242
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Carleton University

Related search

Analyzing Infeasible Mixed-Integer and Integer Linear Programs

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
1999English

Variable Neighbourhood Decomposition Search for 0–1 Mixed Integer Programs

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2010English

A Feasibility Pump Heuristic for General Mixed-Integer Problems

Discrete Optimization
Computational TheoryApplied MathematicsTheoretical Computer ScienceMathematics
2007English

Coefficient Strengthening: A Tool for Formulating Mixed Integer Programs

SSRN Electronic Journal
2007English

Automatic Dantzig–Wolfe Reformulation of Mixed Integer Programs

Mathematical Programming, Series B
MathematicsSoftware
2014English

An Active-Constraint Logic for Non-Linear Programming

Optimal Control Applications and Methods
ControlSystems EngineeringApplied MathematicsOptimizationSoftware
1984English

Polyhedral Approaches to Mixed Integer Linear Programming

2009English

Symplectic Schemes for Linear Stochastic Schrödinger Equations With Variable Coefficients

Abstract and Applied Analysis
Applied MathematicsAnalysis
2014English

QPDAS: Dual Active Set Solver for Mixed Constraint Quadratic Programming

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy