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

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

Greger Ottosson, Erlendur S. Thorsteinsson

Publication date: 27 January 2003

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

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
• Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
• Relaxation Methods for Linear Programs
• scientific article; zbMATH DE number 1336278

zbMATH Keywords

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

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cited In (5)

• A first look at picking dual variables for maximizing reduced cost fixing
• Title not available (Why is that?)
• Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound
• Domain reduction techniques for global NLP and MINLP optimization
• Cost-based filtering for shorter path constraints

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)