Linear relaxations and reduced-Cost based propagation of continuous variable subscripts

DOI10.1023/A:1021136801775zbMATH Open1011.90030MaRDI QIDQ1854751FDOQ1854751

Authors Erlendur S. Thorsteinsson, Greger Ottosson

Publication date 27 January 2003

Published in Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

integrationmixed integer programmingconstraint logic programmingreduced costsdynamic linear relaxationsinference,propagationmixed global constraintsvariable subscripts

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Recommendations

• Linear-time variational integrators in maximal coordinates
• Relaxed Krylov subspace approximation
• Numerical representations of a universal subspace flow for linear programs
• Linearization of McCormick relaxations and hybridization with the auxiliary variable method
• On the Continuous Trajectories for a Potential Reduction Algorithm for Linear Programming
• scientific article; zbMATH DE number 5669891
• Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
• Relaxation Methods for Linear Programs
• scientific article; zbMATH DE number 1336278

Cited in

(5)

• Cost-based filtering for shorter path constraints
• A first look at picking dual variables for maximizing reduced cost fixing
• Domain reduction techniques for global NLP and MINLP optimization
• Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound
• scientific article; zbMATH DE number 2080319 (Why is no real title available?)

Describes a project that uses

Uses Software

• SICStus

This page was built for publication: Linear relaxations and reduced-Cost based propagation of continuous variable subscripts

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