The \textsc{WeightedCircuitsLmax} constraint
type: Item
instance of: scholarly article
title: The \textsc{WeightedCircuitsLmax} constraint
DOI: 10.1007/978-3-319-93031-2_35
author: Kim Rioux-Paradis
author: Claude-Guy Quimper
publication date: 2018-11-21T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6982413
zbMATH Keywords: Travelling Salesman problem, min-max objective, filtering algorithm
MaRDI profile type: Publication
full work available at URL: 978-3-319-93031-2 35
OpenAlex ID: W2806899243
Recommended article: A weighted counting algorithm for the circuit constraint
Recommended article: The Weighted Cfg Constraint
Recommended article: Improved filtering for weighted circuit constraints
Recommended article: Maximum weight edge-constrained matchings
Recommended article: Exploring the constrained maximum edge-weight connected graph problem
Recommended article: A new approach for weighted constraint satisfaction
Recommended article: Algorithms for the constrained maximum-weight connected graph problem
Recommended article: The Weighted Spanning Tree Constraint Revisited
Recommended article: The “Not-Too-Heavy Spanning Tree” Constraint
Recommended article: An efficient solver for weighted Max-SAT
description: scientific article; zbMATH DE number 6982413