Constraint-Driven Method for Combinatorial Optimization

We propose an algorithm to find the approximate global minimum of the Ising Hamiltonian, treating each spin as a complex field governed by the Schrödinger equation with a designed nonlinear potential.

Authors

Q-Han Park
Hyunjun Ma (ORCID: https://orcid.org/0000-0002-2448-3233)

Institutions

Korea University (KR)

Publication Details

Published: 2024-08-04
DOI: https://doi.org/10.1109/cleo-pr60912.2024.10676554
Primary Topic: Constraint Satisfaction and Optimization
Type: article
Field-Weighted Citation Impact: 0.00

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

Constraint-Driven Method for Combinatorial Optimization

Q-Han Park, Hyunjun Ma

Aug 4, 2024

Constraint Satisfaction and Optimization

article

Constraint-Driven Method for Combinatorial Optimization

Q-Han Park, Hyunjun Ma

August 4, 2024article en

Abstract

Vol. 9

Korea University (KR)

Openalex Percentile: Top 82%

Constraint Satisfaction and Optimization

DOI Source OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Constraint-Driven Method for Combinatorial Optimization — Q-Han Park, Hyunjun Ma · (2024) | TGRS Research Map | TGRS