The following pages link to Claudio Sterle (Q337082):
Displayed 16 items.
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083) (← links)
- A fast heuristic for a three-dimensional non-convex domain loading problem (Q538281) (← links)
- Flow intercepting facility location: Problems, models and heuristics (Q841607) (← links)
- Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm (Q1652448) (← links)
- A MILP formulation for the reorganization of the blood supply chain in Italian regions (Q2089615) (← links)
- An optimization-based approach to assess non-interference in labeled and bounded Petri net systems (Q2123401) (← links)
- The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm (Q2317621) (← links)
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes (Q2481606) (← links)
- A unified solving approach for two and three dimensional coverage problems in sensor networks (Q2629914) (← links)
- Noninterference Enforcement via Supervisory Control in Bounded Petri Nets (Q4957611) (← links)
- Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches (Q5148189) (← links)
- Comments on: ``Static and dynamic source locations in undirected networks'' (Q5966289) (← links)
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)
- An integrated <scp>user‐system</scp> approach for shelter location and evacuation routing (Q6087143) (← links)
- The parallel AGV scheduling problem with battery constraints: a new formulation and a matheuristic approach (Q6109805) (← links)
- A new <i>MILP</i> formulation for the flying sidekick traveling salesman problem (Q6139381) (← links)