Analysis of a generalized linear ordering problem via integer programming

DOI10.1016/J.DAM.2019.08.010zbMATH Open1432.90087OpenAlexW2972835431MaRDI QIDQ2009010FDOQ2009010

Authors: Gustavo Vulcano, Paula Zabala, Isabel Méndez-Díaz 

Publication date: 27 November 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.08.010

Recommendations

• scientific article; zbMATH DE number 3902051
• A Cutting Plane Algorithm for the Linear Ordering Problem
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• The linear ordering problem with clusters: a new partial ranking
• Applying mod-\(k\)-cuts for solving linear ordering problems

zbMATH Keywords

integer programmingvalid inequalitiesbranch and cutlinear ordering

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of mathematical programming (90C90) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Geometric algorithms and combinatorial optimization
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Title not available (Why is that?)
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• A branch-and-cut algorithm for the maximum cardinality stable set problem
• Facets of the linear ordering polytope
• A Cutting Plane Algorithm for the Linear Ordering Problem
• Optimal Weighted Ancestry Relationships
• On approximability of linear ordering and related NP-optimization problems on graphs.

Cited In (2)

• The linear ordering problem with clusters: a new partial ranking
• A linear ordering problem with weighted rank

This page was built for publication: Analysis of a generalized linear ordering problem via integer programming

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