Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments

DOI10.1016/j.ejor.2019.07.021zbMath1430.90225arXiv1902.04145OpenAlexW2958080633MaRDI QIDQ2273901

Gautier Stauffer, Vincent Juliard, Dehia Ait-Ferhat, Juan Andres Torres

Publication date: 18 September 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.04145

zbMATH Keywords

integer programminggraph coloringDSAlithographyintegrated circuit manufacturing

Mathematics Subject Classification ID

Integer programming (90C10) Production models (90B30) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exact approach for the vertex coloring problem
• Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
• Computational complexity of \((2,2)\) path chromatic number problem
• New integer linear programming models for the vertex coloring problem
• On the asymmetric representatives formulation for the vertex coloring problem
• A branch-and-cut algorithm for graph coloring
• Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
• A survey on vertex coloring problems
• Improper coloring of unit disk graphs
• A Column Generation Approach for Graph Coloring
• Detour Chromatic Numbers
• Reducibility among Combinatorial Problems

This page was built for publication: Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments