LOLIB

swMATH12655MaRDI QIDQ24581FDOQ24581

Author name not available (Why is that?)

Cited In (85)

• Global Approaches for Facility Layout and VLSI Floorplanning
• Title not available (Why is that?)
• Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
• On the feedback vertex set problem for a planar graph
• A minimum violations ranking method
• Title not available (Why is that?)
• Applying mod-\(k\)-cuts for solving linear ordering problems
• The linear ordering problem with clusters: a new partial ranking
• Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
• Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• Determining the automorphism group of the linear ordering polytope
• The linear ordering problem: instances, search space analysis and algorithms
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• The generalized assignment problem: Valid inequalities and facets
• On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope
• Signed orders, choice probabilities, and linear polytopes
• Facets of linear signed order polytopes.
• A benchmark library and a comparison of heuristic methods for the linear ordering problem
• Computational results of an interior point algorithm for large scale linear programming
• Exact algorithms for the quadratic linear ordering problem
• The quadratic assignment problem. Theory and algorithms
• The strongest facets of the acyclic subgraph polytope are unknown
• DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
• NP-hardness results for the aggregation of linear orders into median orders
• Rank aggregation in cyclic sequences
• Primary facets of order polytopes
• A branch-and-cut algorithm for a resource-constrained scheduling problem
• A Cutting Plane Algorithm for the Linear Ordering Problem
• The Rankability of Data
• The median procedure in the semilattice of orders
• Title not available (Why is that?)
• Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
• An experimental evaluation of a scatter search for the linear ordering problem
• Extremal values of global tolerances in combinatorial optimization with an additive objective function
• The complexity of computing medians of relations.
• A cutting-plane approach to the edge-weighted maximal clique problem
• Geometric and combinatorial properties of the polytope of binary choice probabilities
• Induced binary probabilities and the linear ordering polytope: A status report
• On the integral dicycle packings and covers and the linear ordering polytope
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• A note on small linear-ordering polytopes
• On VLSI interconnect optimization and linear ordering problem
• A cutting plane algorithm for a clustering problem
• Generalized transitive tournaments and doubly stochastic matrices
• Fifty-Plus Years of Combinatorial Integer Programming
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• Revised GRASP with path-relinking for the linear ordering problem
• Computational Approaches to Max-Cut
• Title not available (Why is that?)
• Parameterized algorithmics for linear arrangement problems
• Independent random utility representations
• Title not available (Why is that?)
• Generalizing the concept of binary choice systems induced by rankings: One way of probabilizing deterministic measurement structures
• The biorder polytope
• A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems
• Exact solution procedures for the balanced unidirectional cyclic layout problem
• Context-independent scatter and tabu search for permutation problems
• The rankability of weighted data from pairwise comparisons
• Probabilistic asymptotic properties of some combinatorial optimization problems
• Variable neighborhood search for the linear ordering problem
• A survey on the linear ordering problem for weighted or unweighted tournaments
• A general meta-heuristic based solver for combinatorial optimisation problems
• Title not available (Why is that?)
• How to recycle your facets
• On discrete optimization with ordering
• Branch distance optimization of structured programs
• Distance and consensus for preference relations corresponding to ordered partitions
• Combinatorial optimization and small polytopes
• Set packing relaxations of some integer programs
• On the partial order polytope of a digraph
• The linear ordering problem with cumulative costs
• Title not available (Why is that?)
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions
• New Facets of the Linear Ordering Polytope
• A branch-and-bound algorithm for the linear ordering problem with cumulative costs
• Scatter Search and Path Relinking: Advances and Applications
• Title not available (Why is that?)
• Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem
• Title not available (Why is that?)
• LAGRANGIAN RELAXATION AND PEGGING TEST FOR LINEAR ORDERING PROBLEMS(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions))
• A branch-and-cut algorithm for the target visitation problem
• An optimization model for the student-to-project supervisor assignment problem-the case of an engineering department
• \((0,{1\over 2},1)\) matrices which are extreme points of the generalized transitive tournament polytope
• On the combinatorial structure of the approval-voting polytope

This page was built for software: LOLIB