The following pages link to Erwin Pesch (Q193684):
Displayed 50 items.
- The partitioning min-max weighted matching problem (Q320079) (← links)
- A branch-and-bound algorithm for the acyclic partitioning problem (Q336782) (← links)
- \((r|p)\)-centroid problems on networks with vertex and edge demand (Q339626) (← links)
- Exact algorithms for inventory constrained scheduling on a single machine (Q398845) (← links)
- Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
- Sequential competitive location on networks (Q439407) (← links)
- Minimizing maximum weight of subsets of a maximum matching in a bipartite graph (Q499331) (← links)
- Blocking optimal arborescences (Q507342) (← links)
- A generic approach to proving NP-hardness of partition type problems (Q608273) (← links)
- Extended formulations, nonnegative factorizations, and randomized communication protocols (Q745681) (← links)
- Uncapacitated flow-based extended formulations (Q745688) (← links)
- Selected papers from the Dagstuhl Workshop (Q880582) (← links)
- A note on the two machine job shop with the weighted late work criterion (Q880589) (← links)
- Strategic supply chain management in process industries. An application to specialty chemicals production network design. (Q885896) (← links)
- Approximation algorithms for inventory constrained scheduling on a single machine (Q906561) (← links)
- Analysis, modeling and solution of the concrete delivery problem (Q954932) (← links)
- Analysis and design of discrete part production lines (Q1022025) (← links)
- Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities (Q1040690) (← links)
- A characterization of absolute retracts of n-chromatic graphs (Q1076682) (← links)
- Item:Q193684 (redirect page) (← links)
- Dismantling absolute retracts of reflexive graphs (Q1121291) (← links)
- A Radon theorem for Helly graphs (Q1123404) (← links)
- Efficient characterizations of \(n\)-chromatic absolute retracts (Q1186122) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- A note on disjunctive graph representation (Q1307847) (← links)
- Genetic local search in combinatorial optimization (Q1317048) (← links)
- Evolution based learning in a job shop scheduling environment (Q1342315) (← links)
- Model-based inference in CHARME. (Q1342427) (← links)
- TSP ejection chains (Q1363749) (← links)
- A branch-and-bound algorithm for the resource-constrained project scheduling problem (Q1401642) (← links)
- Symmetry properties of chordal rings of degree 3 (Q1406021) (← links)
- Open shop scheduling problems with late work criteria. (Q1421458) (← links)
- Constraint propagation techniques for the disjunctive scheduling problem (Q1583518) (← links)
- The disjunctive graph machine representation of the job shop scheduling problem (Q1590037) (← links)
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss (Q1634066) (← links)
- An integrated model for the transshipment yard scheduling problem (Q1707671) (← links)
- Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs (Q1744245) (← links)
- The windy rural postman problem with a time-dependent zigzag option (Q1751757) (← links)
- Flight gate scheduling with respect to a reference schedule (Q1761900) (← links)
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (Q1767678) (← links)
- The two-machine flow-shop problem with weighted late work criterion and common due date (Q1772844) (← links)
- New approximation results for the maximum scatter TSP (Q1774146) (← links)
- Time continuity in discrete time models. New approaches for production planning in process industries. (Q1774493) (← links)
- Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
- Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem (Q1854756) (← links)
- Profile minimization on triangulated triangles (Q1861244) (← links)
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue (Q1908990) (← links)
- An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand (Q1939682) (← links)
- Provision-after-wait with preferences ordered by difference: tighter complexity and better approximation (Q2029277) (← links)
- Stronger mixed-integer programming-formulations for order- and rack-sequencing in robotic mobile fulfillment systems (Q2103003) (← links)