A Branch-Price-And-Cut Procedure for the Discrete Ordered Median Problem

INFORMS Journal on Computing - United States
doi 10.1287/ijoc.2019.0915
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

A Branch-And-Bound Method for the Multichromosomal Reversal Median Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Robust Branch-Cut-And-Price for the Capacitated Minimum Spanning Tree Problem Over a Large Extended Formulation

Mathematical Programming, Series B
MathematicsSoftware
2006English

Heuristics of the Branch-Cut-And-Price-Framework SCIP

English

A Branch-And-Price Approach to P-Median Location Problems

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2005English

Solving the Orienteering Problem Through Branch-And-Cut

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
1998English

Solving the Ordered One-Median Problem in the Plane

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2009English

A Branch-And-Price Algorithm for the Long-Term Home Care Scheduling Problem

Operations Research Proceedings 2011
2012English

A Branch-And-Cut Approach for a Generic Multiple-Product, Assembly-System Design Problem

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2004English

A Column-Generation and Branch-And-Cut Approach to the Bandwidth-Packing Problem

Journal of Research of the National Institute of Standards and Technology
Engineering
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy