Pages that link to "Item:Q3217947"

The following pages link to A Cutting Plane Algorithm for the Linear Ordering Problem (Q3217947):

Displaying 44 items.

• On the linear ordering problem and the rankability of data (Q2072628) (← links)
• Computing in combinatorial optimization (Q2075761) (← links)
• Disentangling relationships in symptom networks using matrix permutation methods (Q2141642) (← links)
• Fairness and the set of optimal rankings for the linear ordering problem (Q2168622) (← links)
• An integer programming approach for the search of discretization orders in distance geometry problems (Q2174886) (← links)
• An exact algorithm for the edge coloring by total labeling problem (Q2178329) (← links)
• Ising formulations of some graph-theoretic problems in psychological research: models and methods (Q2244634) (← links)
• Block-insertion-based algorithms for the linear ordering problem (Q2289935) (← links)
• New exact approaches to row layout problems (Q2295979) (← links)
• On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming (Q2337226) (← links)
• A note on small linear-ordering polytopes (Q2368130) (← links)
• Dynamic bundle methods (Q2390994) (← links)
• A branch-and-bound algorithm for the linear ordering problem with cumulative costs (Q2426525) (← links)
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments (Q2433800) (← links)
• The linear ordering problem with cumulative costs (Q2482806) (← links)
• Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)
• Variable neighborhood search for the linear ordering problem (Q2496057) (← links)
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions (Q2568330) (← links)
• The linear ordering problem revisited (Q2629715) (← links)
• A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
• Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date (Q2676340) (← links)
• On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem (Q2773025) (← links)
• Linear time algorithms to solve the linear ordering problem for oriented tree based graphs (Q2805488) (← links)
• Exact algorithms for the quadratic linear ordering problem (Q2899047) (← links)
• A branch-and-cut algorithm for a resource-constrained scheduling problem (Q3004200) (← links)
• LAGRANGIAN RELAXATION AND PEGGING TEST FOR LINEAR ORDERING PROBLEMS(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions)) (Q3144756) (← links)
• On the acyclic subgraph polytope (Q3698818) (← links)
• Facets of the linear ordering polytope (Q3698819) (← links)
• Solving matching problems with linear programming (Q3703653) (← links)
• Quadratic assignment problems on series-parallel digraphs (Q3730344) (← links)
• A branch and bound algorithm for the minimum storage-time sequencing problem (Q4434517) (← links)
• (Q4637014) (← links)
• New Facets of the Linear Ordering Polytope (Q4699161) (← links)
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079) (← links)
• A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
• The Rankability of Data (Q5025777) (← links)
• The Boolean Quadric Polytope (Q5050144) (← links)
• Robust Learning of Consumer Preferences (Q5080653) (← links)
• An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
• Randomized Algorithms for Lexicographic Inference (Q5126607) (← links)
• Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
• Developing a ranking problem library (RPLIB) from a data-oriented perspective (Q6050403) (← links)
• A linear ordering problem with weighted rank (Q6117320) (← links)
• The longest run subsequence problem (Q6487630) (← links)