The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We aim to derive effective lower bounds for the Discrete Cost Multicommodity Network Design Problem (DCMNDP). Given an undirected graph, the problem requires installing at most one facility on each edge such that a set of point-to-point commodity flows can be routed and costs are minimized. In the literature, the Lagrangian relaxation is usually applied to an arc-based formulation to derive lower...
Today's supply chain are highly complex and globally set-up underlying a constant change with increasing speed. This has to be reflected by the planning processes and algorithms being utilized in the different stages of a supply chain. In the context of production planning, meta-heuristics are usually applied due to their ability to handle high complex problems. As a consequence, these algorithms...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.