Analysis of a generalized linear ordering problem via integer programming

DOI10.1016/j.dam.2019.08.010zbMath1432.90087OpenAlexW2972835431MaRDI QIDQ2009010

Paula Zabala, Gustavo J. Vulcano, 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

zbMATH Keywords

integer programmingbranch and cutvalid inequalitieslinear ordering

Mathematics Subject Classification ID

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

Related Items (1)

A linear ordering problem with weighted rank

Cites Work

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

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