An implicit enumeration scheme for the batch selection problem

DOI10.1002/NET.20025MaRDI QIDQ3156829zbMATH OpenOpenAlexFDO

Authors Fabrizio Rossi, Stefano Smriglio, Alessandro Agnetis

Publication date 12 January 2005

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20025

zbMATH Keywords

branch and boundnonlinear knapsackILP formulationsLogistic networks

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06) Production models (90B30)

Recommendations

• Implicit enumeration strategies for the hypervolume subset selection problem
• An Improved Implicit Enumeration Approach for Integer Programming
• An implicit enumeration method for global optimization problems
• A unified approach for solving sequential selection problems
• A class of optimal combinatorial batch code
• Deterministic and iterative solutions to subset selection problems
• An implicit enumeration procedure for the general linear complementarity problem
• scientific article; zbMATH DE number 3980925
• Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem

This page was built for publication: An implicit enumeration scheme for the batch selection problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3156829)